Added Uint8 and Uint16 typed array sorting algorithms, based on Counting Sort, which is ludicrous speed

Author: LAPTOP-465HP6VI\Victor

CountingSort.js

@@ -0,0 +1,76 @@
+
+var HpcAlgorithms = HpcAlgorithms || {};
+
+HpcAlgorithms.Sorting = (function()
+{
+	var HistogramOneByteComponentUInt8 = function(inArray)
+	{
+		var numberOfBins = 256;
+
+		var count = new Array(numberOfBins);
+		for (var b = 0; b < numberOfBins; b++)
+			count[b] = 0;
+
+		for (var i = 0; i < inArray.length; i++)
+			count[ inArray[i] ]++;
+
+		return count;
+	}
+
+	/**
+	 * Counting Sort of typed unsigned byte array
+	 * This algorithm is in-place
+	 * @param  {Array of bytes} inputArray Array of numbers, which must be a typed array of unsigned bytes
+	 * @return {Array of bytes} Sorted array of unsigned bytes
+	 */
+	var SortCountingUInt8 = function(inputArray)
+	{
+		var count = HistogramOneByteComponentUInt8(inputArray);
+
+			var startIndex = 0;
+			for (var countIndex = 0; countIndex < count.length; countIndex++)
+			{
+				inputArray.fill(countIndex, startIndex, startIndex + count[countIndex]);  // 2X faster than using a for loop to fill an array
+				startIndex += count[countIndex];
+			}
+			return inputArray;
+	}
+
+	var HistogramOneWordComponent = function(inArray)
+	{
+		var numberOfBins = 65536;
+
+		var count = new Array(numberOfBins);
+		for (var b = 0; b < numberOfBins; b++)
+			count[b] = 0;
+
+		for (var current = 0; current < inArray.length; current++)
+			count[ inArray[current] ]++;
+
+		return count;
+	}
+
+	/**
+	 * Counting Sort of typed unsigned short array typed array
+	 * This algorithm is in-place
+	 * @param  {Array of unsigned short} inputArray Array of numbers, which must be a typed array of unsigned short
+	 * @return {Array of unsigned short} Sorted array of unsigned short numbers
+	 */
+	var SortCountingUInt16 = function(inputArray)
+	{
+			var count = HistogramOneWordComponent(inputArray);
+
+			var startIndex = 0;
+			for (var countIndex = 0; countIndex < count.length; countIndex++)
+			{
+				inputArray.fill(countIndex, startIndex, startIndex + count[countIndex]);
+				startIndex += count[countIndex];
+			}
+			return inputArray;
+	}
+		
+	return {
+		SortCountingUInt8: SortCountingUInt8,
+		SortCountingUInt16: SortCountingUInt16
+	};
+})();

readme.md

@@ -6,16 +6,18 @@ Let us know what other algorithms could use acceleration or improvement.
 # High Performance Computing Algorithms in JavaScript
 
 Faster and Better Algorithms, starting with high performance sorting:
-- LSD Radix Sort for unsigned integer arrays. 20-30X faster than JavaScript's built-in array sort for arrays less than 35 Million.
+- LSD Radix Sort for unsigned 32-bit integer arrays. 20-30X faster than JavaScript's built-in array sort for arrays less than 35 Million.
 5-10X faster for arrays greater than 35 Million. This sort algorithm is not in-place, returning a new sorted array.
 Discussion, benchmarks and usage in https://duvanenko.tech.blog/2017/06/15/faster-sorting-in-javascript/
 - LSD Radix Sort for arrays of objects by an unsigned integer key. 15X faster than JavaScript's built-in .sort().
 This is a stable sort, while JavaScript built-in is not stable. This sort algorithm is not in-place, returning a new sorted array.
 Discussion, benchmarks and usage in https://duvanenko.tech.blog/2017/07/10/sorting-arrays-of-objects-in-javascript-with-radix-sort/
+- Counting Sort for Uint8 and Uint16 typed arrays. 40X faster for Uint8 arrays and 15X faster for Uint16 arrays.
+This sort algorithm is in-place.
 
 When you benchmark these algorithms keep in mind that for the first few runs the basic JavaScript JIT compiler is used, providing fast
 start up time and giving time for the optimizing compiler to run. After these few runs the optimized code starts being used,
-revealing the full performance of LSD Radix Sort algorithms. See https://blog.sessionstack.com/how-javascript-works-inside-the-v8-engine-5-tips-on-how-to-write-optimized-code-ac089e62b12e
+revealing the full performance of LSD Radix Sort and Counting Sort algorithms. See https://blog.sessionstack.com/how-javascript-works-inside-the-v8-engine-5-tips-on-how-to-write-optimized-code-ac089e62b12e
 for more details about the JIT engine in Chrome.
 
 # Examples