Adding Java sorting algorithms with a random array

Question

"To this program we will add the quick sort and the merge sort (non recursive)". I'm not sure how to do this with a random array. I formed this code so far, can anyone help?

import java.util.Random; public class Algo {

public static void main(String[] args) {
Random gen = new Random();
int[] a = new int[20];

for (int i = 0; i < a.length; i++)
a[i] = gen.nextInt(100);

printArray(a);
}

private static void printArray(int[] a){
for (int i : a)
System.out.print(i + " ");
System.out.println("");
}


}

}

Quick note, I think you want that println call outside of the for loop in printArray. — Coeffect
– Coeffect, Commented Mar 19, 2012 at 0:40

Óscar López · Accepted Answer · 2012-03-19 00:34:41Z

1

To generate an array of random elements, try this:

int[] array = new int[20];
Random random = new Random();
for (int i = 0; i < array.length; i++)
    array[i] = random.nextInt();

... Afterwards you can work on your merge sort and quick sort algorithms. What have you done so far?

public static void mergeSort(int[] array) {
    // sorts the array in-place using merge sort algorithm
}

public static void quickSort(int[] array) {
    // sorts the array in-place using quick sort algorithm
}

answered Mar 19, 2012 at 0:34

Óscar López

237k38 gold badges321 silver badges391 bronze badges

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

Collectives™ on Stack Overflow

Adding Java sorting algorithms with a random array

1 Answer 1

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Your Answer

Sign up or log in

Post as a guest

Related