[Solved] bubbleSorting + binary searching from methods .

[Omar Perez]

Thank you all folks for all the solutions and proposals, really appreciated.

This the code (done in three classes).

First the bubble sort code an Algorithm for sorting values, in this from min to max;

/*

[code=java]public class BubbleSort {
    public void bubbleSort(int[] array){
        int aux = 0;
        boolean change = false;
        
        while(true){
            change = false;
            for(int i = 1; i < array.length; i++){
                if(array[i] < array[i-1]){
                    aux = array[i];
                    array[i] = array[i-1];
                    array[i-1] = aux;
                    change = true;
                    
                }
            }
            if(change == false){
                break;
            }
        }
        
    }
}

The bubble code was for a binary search, this is the code for binary search (iterative way);

public class BinarySearch {

    public int binarySearch(int[] search, int find) {
        int first = 0;
        int last = search.length - 1;
        int center;
        
        while(first <= last){
            
            center = (first + last) / 2;
            if(search[center] == find){
                return center;
            
            }else if(search[center] < find){
                
                first = center + 1;
                
            }else {
                
                last = center -1;
            }
            
        }
        
        return -1;
    }
}

No you guys are in charge of working the main class. Thank you all for your collaboration.

[Stephan van Hulst]

Hi Omar,

I haven't looked at your code very carefully, but it looks like you're doing something dangerous on line 43: maybe you should use the == operator instead of the = operator.

[Omar Perez]

Stephan van Hulst wrote:Hi Omar,

I haven't looked at your code very carefully, but it looks like you're doing something dangerous on line 43: maybe you should use the == operator instead of the = operator.

fixed, I got the exception fixed, now having issues with method not returning all values sorted.

[Seetharaman Venkatasamy]

I do argue you to see Bubble_sort, then your program

[fred rosenberger]

it is returning one number because you are telling it to:

return array[9];

says "return the element of the array at index position 9" and NOT "return an array with 9 elements".

[Jeff Verdegan]

Omar Perez wrote:

Stephan van Hulst wrote:Hi Omar,

I haven't looked at your code very carefully, but it looks like you're doing something dangerous on line 43: maybe you should use the == operator instead of the = operator.

fixed, I got the exception fixed, now having issues with method not returning all values sorted.

Better yet get rid of the == altogether.

// NO
if (x == true)
if (x != false)

// Do this instead:
if (x)


// NO
if (x == false)
if (x != true)
 
// Do this instead
if (!x)