How to call a particular mathod

Question

the problem is with my method for the binary search i believe its coded properly but i'm not sure how too call it at the bottom of the program.[b[]
here's the error i'm receiving
Binary (int[],int) cannot be applied to ()
how should i call it then? the binary search is marked with a comment
import java.io.*;
import java.util.Random;
public class ArraySort{
     int[] myArray, tobesaved;
     int myArraySize, myArrayHigh, findthis;
     long timeBegin, timeEnd;
     public ArraySort(){
     public int[] createIntegerArray(){
          System.out.print("\nEnter how large the array should be: ");
          BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
          try {
               String theinput = br.readLine();
               try {
                    myArraySize = Integer.parseInt(theinput);
                    if(myArraySize<=0){
                         System.out.println("The size of the array must be positive");
                         createIntegerArray();
               catch(NumberFormatException e){
                    System.out.println("Size of the array must be a number");
                    createIntegerArray();
          catch(IOException e){
               System.out.println("Input Error");
               System.exit(0);
          return new int[myArraySize];
     public int promptArrayHigh(){
          System.out.print("Enter the high range of the array: ");
          BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
          try {
               String theinput = br.readLine();
               return Integer.parseInt(theinput);
          catch(IOException e){
               System.out.println("Input Error"); System.exit(0);
          return 0;
     public void propagateArray(){
          tobesaved = new int[myArraySize];
          Random r = new Random();
          for(int i=0;i<myArraySize;i++){
               myArray[i] = Math.abs(r.nextInt()) % myArrayHigh;
               tobesaved[i] = myArray;
          System.out.print("Original Array: "+myArray[i]);
     public void displayStatus(){
          for(int i=0;i<myArray.length;i++){
               System.out.print(myArray[i]+" ");
          System.out.println("");
     public void sCounter(){
          timeBegin = System.currentTimeMillis();
     public void eCounter(){
          timeEnd = System.currentTimeMillis();
     public void displayTimeDifference(String what){
          System.out.println(what+" took: "+(timeEnd-timeBegin)+" milliseconds");
     public int getInteger(String prompt){
          String word = null;
          int returnint = 0;
          System.out.print(prompt);
          BufferedReader intbuffer = new BufferedReader(new InputStreamReader(System.in));
          try {
               word = intbuffer.readLine();
          catch(IOException ioe){
               System.out.println("Error");
               getInteger(prompt);
               System.exit(1);
          try{
               returnint = Integer.parseInt(word);
               if(returnint<=0){
                    System.out.println("Must be positive.");
                    getInteger(prompt);
                    return returnint;
               else {
                    return returnint;
          catch(NumberFormatException e){
               System.out.println("Must be a number.");
               getInteger(prompt);
               return returnint;
//Bubble Sort
     public void Bubble(){
          boolean swapoccured = true;
          int temp = 0;
          while(swapoccured){
               swapoccured = false;
               for(int i=0;i<(myArray.length-1);i++){
                    if(myArray[i]>myArray[i+1]){
                         temp = myArray[i];
                         myArray[i] = myArray[i+1];
                         myArray[i+1] = temp;
                         swapoccured = true;
//Selection Sort
     public void Selection(){
          int temp = 0;
          int minposition = 0;
          for(int i=0;i<myArray.length;i++){
               minposition = i;
               for(int j=i;j<myArray.length;j++){
                    if(myArray[j]<myArray[minposition]){
                         minposition = j;
               temp = myArray[i];
               myArray[i] = myArray[minposition];
               myArray[minposition] = temp;
//Insertion Sort
     public void Insertion(){
          int value = 0;
          for(int i=1;i<myArray.length;i++){
               value = myArray[i];
               int j;
               for(j=i-1;(j>=0) && (myArray[j]>value);j--){
                    myArray[j+1] = myArray[j];
               myArray[j+1] = value;
//Merge Sort
     public void Merge(int low, int high){
          if(low == high){
               return;
          int length = high-low+1;
          int pivot = (low+high)/2;
          Merge(low, pivot);
          Merge(pivot+1, high);
          int working[] = new int[length];
          for(int i = 0; i < length; i++){
               working[i] = myArray[low+i];
          int m1 = 0;
          int m2 = pivot-low+1;
          for(int i = 0; i < length; i++){
               if(m2 <= high-low){
                    if(m1 <= pivot-low){
                         if(working[m1] > working[m2]){
                              myArray[i+low] = working[m2++];
                         else {
                              myArray[i+low] = working[m1++];
                    else {
                         myArray[i+low] = working[m2++];
               else {
                    myArray[i+low] = working[m1++];
//Shell Sort
void Shell(){
     int h = 1;
while ((h * 3 + 1) < myArray.length) {
     h = 3 * h + 1;
while( h > 0 ) {
for (int i = h - 1; i < myArray.length; i++) {
int B = myArray[i];
int j = i;
for( j = i; (j >= h) && (myArray[j-h] > B); j -= h) {
myArray[j] = myArray[j-h];
myArray[j] = B;
h = h / 3;
//search of my choice
     public void search(){
          int counter = 0;
          findthis = getInteger("Seach for: ");
          for(int i=0;i<myArraySize;i++){
               if(myArray[i]==findthis){
                    counter+=1;;
          System.out.println(findthis+" occurs "+counter+" times in the array");
     public void Linear(){
          int counter=0;
          int findthis1 = getInteger("Linear Search for: ");
          for(int index=0;index<myArray.length; index++)
          if(myArray[index]>findthis1)
               break;
          if(myArray[index]==findthis1)
               counter+=1;
          System.out.println(findthis1+" occurs " counter" times in the array");
     //***Here's part of the problem*****
     public int Binary(int[]myArray,int x){
               int findthis2 = getInteger("Binary Search for: ");
          int left=0, right=myArray.length-1,mid;
          if(myArray.length==0 || x<myArray[0])return -1;
          if(x>myArray[right])return myArray.length;
          while (left<right)
               mid=(left+right)/2;
               if (x<myArray[mid])
               right=mid-1;
               else
               left=mid+1;
               System.out.println(myArray.length);
               if (x==myArray[left])return left;
               else return-1;
     public void setOriginal(){
          for(int i=0;i<myArraySize;i++){
               myArray[i] = tobesaved[i];
     public static void main(String[] args){
          // INSTANTIATE OBJECT, CREATE ARRAY WITH HIGH VALUE, FILL WITH RANDOM VALUES
               ArraySort as = new ArraySort();
as.myArray = as.createIntegerArray();
               as.myArrayHigh = as.promptArrayHigh();
               System.out.println("");
               as.propagateArray();
//               as.displayStatus(); System.out.println("");
          // BUBBLE SORT
               as.sCounter();
               as.Bubble();
               as.eCounter();
//               as.displayStatus();
               as.displayTimeDifference("Bubble Sort");
               as.setOriginal();
          // SELECTION SORT
               as.sCounter();
               as.Selection();
               as.eCounter();
//               as.displayStatus();
               as.displayTimeDifference("Selection Sort");
               as.setOriginal();
          // INSERTION SORT
               as.sCounter();
               as.Insertion();
               as.eCounter();
//               as.displayStatus();
               as.displayTimeDifference("Insertion Sort");
               as.setOriginal();
          // MERGE SORT
               as.sCounter();
               as.Merge(0,(as.myArraySize-1));
               as.eCounter();
//               as.displayStatus();
               as.displayTimeDifference("Merge Sort");
               as.setOriginal();
          // SHELL SORT
               as.sCounter();
               as.Shell();
               as.eCounter();
//               as.displayStatus();
               as.displayTimeDifference("Shell Sort");
//search
               as.search();
//Linear
as.Linear();
//****Here's the problem****
// as.Binary();

Answer 1

here's the error i'm receiving
Binary (int[],int) cannot be applied to ()
how should i call it then? the binary search is
marked with a commentThe error message is pretty straightforward: Binary (is that a constructor or a method? If it's a method, begin the method name with a lowercase "b".) needs an array of int and an int as arguments. They have some meaning to that method. You need to provide them.
What they mean is something that you should know and that really has nothing to do with Java programming. It's like trying to call authorizeCreditCard(String cardNumber) without actually passing it a card number. You need to understand what Binary(...) does and why it needs those arguments. Once you understand that, you should know how to provide them.