Binary Search in Java

import java.util.ArrayList;
import java.util.Collections;

public class bstest {

/**
* @param args
*/
public static void main(String[] args) {
search(80);

}

public static void search(int target) {
ArrayList<Integer> list = new ArrayList<Integer>();
list.add(10);
list.add(7);
list.add(80);
list.add(17);
list.add(30);
list.add(57);
list.add(19);
list.add(23);
Collections.sort(list);
list.trimToSize();
int lo = 0, mid = 0, high = list.size();
while (lo < high) {
mid = lo + high / 2;
if (list.get(mid) == target) {
System.out.println(“Number Found” + target);
break;
} else if (list.get(mid) > target)
high–;
else if (list.get(mid) < target)
lo++;
}
}

}

Advertisements

About qainterviews

Software Geek,QA Expert,Blogger
This entry was posted in Uncategorized and tagged . Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s