Commit 0e0f6b7

committed

Test: sort unit tests

- quicksort implementation test. - insertionsort implementation tests.

1 parent 7eb7204 commit 0e0f6b7Copy full SHA for 0e0f6b7

File tree

-5

lines changed

-5

lines changed

1.59 KB

Binary file not shown.

155 Bytes

Binary file not shown.

Lines changed: 5 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -10,9 +10,9 @@ public void doIt() {`
`10`	`10`	`long start, end, time;`
`11`	`11`	`int[] data;`
`12`	`12`
`13`		`- data = new int[200000];`
	`13`	`+ data = new int[15];`
`14`	`14`	`for (int i = 0; i < data.length; i++) {`
`15`		`- int j = (int) (Math.random() * 100000);`
	`15`	`+ int j = (int) (Math.random() * 100);`
`16`	`16`	`data[i] = j;`
`17`	`17`	`}`
`18`	`18`
`@@ -25,11 +25,11 @@ public void doIt() {`
`25`	`25`	`end = System.nanoTime();`
`26`	`26`	`time = end - start;`
`27`	`27`	`System.out.println("Quick sort took: " + time / 1000000000.0 + " seconds");`
`28`		`- //for (int datum : data) { System.out.print(datum + " "); }`
	`28`	`+ for (int datum : data) { System.out.print(datum + " "); }`
`29`	`29`
`30`	`30`	`// Randomize data again for insertion sort`
`31`	`31`	`for (int i = 0; i < data.length; i++) {`
`32`		`- int j = (int) (Math.random() * 100000);`
	`32`	`+ int j = (int) (Math.random() * 100);`
`33`	`33`	`data[i] = j;`
`34`	`34`	`}`
`35`	`35`
`@@ -40,6 +40,6 @@ public void doIt() {`
`40`	`40`	`end = System.nanoTime();`
`41`	`41`	`time = end - start;`
`42`	`42`	`System.out.println("Insertion sort took: " + time / 1000000000.0 + " seconds");`
`43`		`- //for (int datum : data) { System.out.print(datum + " "); }`
	`43`	`+ for (int datum : data) { System.out.print(datum + " "); }`
`44`	`44`	`}`
`45`	`45`	`}`

Comments

(0)