fix: updates the description of counting sort

thawkin3 · thawkin3 · commit 99fc8ab89659 · 2021-06-18T14:03:21.000-06:00
diff --git a/src/algorithms/sort/counting-sort/src/counting-sort.js b/src/algorithms/sort/counting-sort/src/counting-sort.js
@@ -1,9 +1,7 @@
 /**
  * Counting Sort
  *
- * Compares each pair of adjacent items and swaps them if they are in the wrong order
- * Continues looping through the array until no more swaps are needed
- * Not appropriate for large unsorted data sets
+ * Counts the occurrence of each element in the input array and uses that to create a sorted output array
  *
  * Best case performance: Ω(n + k) (always loops through the input array, count array, and output array)
  * Average case performance: θ(n + k) (always loops through the input array, count array, and output array)

Original file line number	Diff line number	Diff line change
`@@ -1,9 +1,7 @@`
`1`	`1`	`/**`
`2`	`2`	`* Counting Sort`
`3`	`3`	`*`
`4`		`- * Compares each pair of adjacent items and swaps them if they are in the wrong order`
`5`		`- * Continues looping through the array until no more swaps are needed`
`6`		`- * Not appropriate for large unsorted data sets`
	`4`	`+ * Counts the occurrence of each element in the input array and uses that to create a sorted output array`
`7`	`5`	`*`
`8`	`6`	`* Best case performance: Ω(n + k) (always loops through the input array, count array, and output array)`
`9`	`7`	`* Average case performance: θ(n + k) (always loops through the input array, count array, and output array)`