Sorting arrays using a recursive binary search

Question

So I am reading in a txt file with a list of unsorted numbers...

14 36 9 87 2 5

My recursive method for the binary search is...

public static int bSearch(int[] a, int lo, int hi, int key)
 {
    int mid = lo+(lo + hi)/2;

    if (lo <= hi) 
        return -(lo+1); 
    else if (a[mid] == key) 
        return mid;
    else if (a[mid] < key)
        return bSearch(a, mid+1, hi, key);
    else 
        return bSearch(a, lo, mid-1, key);
}

I want to sort the values by implementing the recursive binary search. Can someone point me in the direction on how I would go about doing this.

Searching and Sorting are two different things, using one to do the the other would be tricky. You could look at quicksort which is a binary division sorting method. — BevynQ
– BevynQ, Commented Feb 25, 2014 at 3:57

user3297129 · Accepted Answer · 2014-02-25 04:02:37Z

1

Why use binary search for sorting? If you are really looking for divide and conquer strategy, please have a look at merge sort.

answered Feb 25, 2014 at 4:02

user3297129

2991 silver badge6 bronze badges

Sign up to request clarification or add additional context in comments.

Comments

vivekpansara · Accepted Answer · 2014-02-25 04:07:23Z

0

It is possiable to sort using binary search. Take a look: Binary Searching and Sorting

answered Feb 25, 2014 at 4:07

vivekpansara

8971 gold badge6 silver badges14 bronze badges

Comments

Alik Khilazhev · Accepted Answer · 2015-09-27 17:00:48Z

0

Binary search algorithm uses for searching.I guess you mixed up binary search with quicksort algorithm

answered Sep 27, 2015 at 17:00

Alik Khilazhev

1,2068 silver badges21 bronze badges

Collectives™ on Stack Overflow

Sorting arrays using a recursive binary search

3 Answers 3

Comments

Comments

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

3 Answers 3

Comments

Comments

Comments

Your Answer

Sign up or log in

Post as a guest

Related