Commit 5c1faf6

committed

add basicCountingSortWithNegative

1 parent e9ce3a8 commit 5c1faf6Copy full SHA for 5c1faf6

File tree

+33

-2

lines changed

src
- main/java/ir/sk/algorithm/others
  - Sort.java
- test/java/ir/sk/algorithm/others
  - SortTest.java

+33

-2

lines changed

Lines changed: 21 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -508,7 +508,7 @@ public static void treeSort(int[] array) {`
`508`	`508`	`*/`
`509`	`509`	`@TimeComplexity("O(n + k) + O(n) = O(2n + k) = O(n + k) where n is the number of elements in input array and k is the range of input.")`
`510`	`510`	`@SpaceComplexity("nO(n + k)")`
`511`		`- public static void countSort(int[] input) {`
	`511`	`+ public static void basicCountSort(int[] input) {`
`512`	`512`	`int max = Arrays.stream(input).max().getAsInt();`
`513`	`513`
`514`	`514`	`// create buckets`
`@@ -527,6 +527,26 @@ public static void countSort(int[] input) {`
`527`	`527`	`}`
`528`	`528`	`}`
`529`	`529`
	`530`	`+ @TimeComplexity("O(n + k) + O(n) = O(2n + k) = O(n + k) where n is the number of elements in input array and k is the range of input.")`
	`531`	`+ @SpaceComplexity("nO(n + k)")`
	`532`	`+ public static void basicCountingSortWithNegative(int[] array) {`
	`533`	`+ int min = Arrays.stream(array).min().getAsInt();`
	`534`	`+ int max = Arrays.stream(array).max().getAsInt();`
	`535`	`+`
	`536`	`+ int range = max - min + 1;`
	`537`	`+ int[] counter = new int[range];`
	`538`	`+`
	`539`	`+ for (int i = 0 ; i < array.length; i++) {`
	`540`	`+ counter[array[i] - min]++;`
	`541`	`+ }`
	`542`	`+`
	`543`	`+ int index = 0;`
	`544`	`+ for (int i = 0; i < counter.length; i++) {`
	`545`	`+ for (int j = 0; j < counter[i]; j++) {`
	`546`	`+ array[index++] = i + min;`
	`547`	`+ }`
	`548`	`+ }`
	`549`	`+ }`
`530`	`550`
`531`	`551`	`/**`
`532`	`552`	`* Counting sort which takes negative numbers as well`

Lines changed: 12 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -140,7 +140,7 @@ public void treeSort() {`
`140`	`140`	`@Test`
`141`	`141`	`public void countingSort() {`
`142`	`142`	`long start = System.currentTimeMillis();`
`143`		`- Sort.countSort(actual);`
	`143`	`+ Sort.basicCountSort(actual);`
`144`	`144`	`long end = System.currentTimeMillis();`
`145`	`145`	`System.out.println("Logic countingSort took " + (end - start) + " MilliSeconds");`
`146`	`146`	`assertArrayEquals(expected, actual);`
`@@ -157,6 +157,17 @@ public void countingSortWithNegative() {`
`157`	`157`	`assertArrayEquals(expected, arr);`
`158`	`158`	`}`
`159`	`159`
	`160`	`+ @Test`
	`161`	`+ public void basicCountingSort() {`
	`162`	`+ int[] arr = new int[]{9, 2, 1, 5, 5, 6, -2};`
	`163`	`+ int[] expected = new int[]{-2, 1, 2, 5, 5, 6, 9};`
	`164`	`+ long start = System.currentTimeMillis();`
	`165`	`+ Sort.basicCountingSortWithNegative(arr);`
	`166`	`+ long end = System.currentTimeMillis();`
	`167`	`+ System.out.println("Logic countingSortWithNegative took " + (end - start) + " MilliSeconds");`
	`168`	`+ assertArrayEquals(expected, arr);`
	`169`	`+ }`
	`170`	`+`
`160`	`171`	`@Test`
`161`	`172`	`public void quickSort() {`
`162`	`173`	`long start = System.currentTimeMillis();`

Comments

(0)