binary sort in java

[ushujerra]

How do I write this binary sort in java using array?
You have write a method that will use binary search to see if a given element is in the array. Assume that the array is already sorted in ascending order. I don't understand binary searches, but if someone shows me through this method what a binary search does, I would be grateful. Thank you.
public boolean findNum(int[] nums, int theNum)
{
}

[Darko]

Code: Select all

public boolean findNum(int[] nums, int theNum)
{
  return Arrays.binarySearch(nums, theNum) >= 0;
}