Project Euler 112

A brute force attack on Project Euler #112. I suspect there is a more efficient algorithm for this (not using string conversions), but this works.

function Test-Bouncy {          
  param([int]$num)          
  $up=$down=$false          
  $numArray = $num.ToString().ToCharArray()          
  $length = $numArray.Length          
  for($i=1; $i -lt $length; $i++) {          
      if ($numArray[$i-1] -lt $numArray[$i]) {          
          $up = $true          
      }          
      elseif ($numArray[$i-1] -gt $numArray[$i]) {          
          $down = $true          
      }          
      if ($up -and $down) {          
          return $true          
      }          
  }          
  return $false            
}          
        
$isBouncy = $ratio = 0          
$x = 1          
while ($ratio -lt .99) {          
  if(Test-Bouncy $x) {          
      $isBouncy++          
      $ratio = $isBouncy/$x                  
  }          
  $x++          
}          
        
"{0}`t{1}" -f ($x-1),$ratio

Enjoy!