├── CountingSort.js ├── LICENSE ├── RadixSort.js ├── package.json └── readme.md /CountingSort.js: -------------------------------------------------------------------------------- 1 | 2 | var HpcAlgorithms = HpcAlgorithms || {}; 3 | 4 | HpcAlgorithms.Sorting = (function() 5 | { 6 | var HistogramOneByteComponentUInt8 = function(inArray) 7 | { 8 | var numberOfBins = 256; 9 | 10 | var count = new Array(numberOfBins); 11 | for (var b = 0; b < numberOfBins; b++) 12 | count[b] = 0; 13 | 14 | for (var i = 0; i < inArray.length; i++) 15 | count[ inArray[i] ]++; 16 | 17 | return count; 18 | } 19 | 20 | /** 21 | * Counting Sort of typed unsigned byte array 22 | * This algorithm is in-place 23 | * @param {Array of bytes} inputArray Array of numbers, which must be a typed array of unsigned bytes 24 | * @return {Array of bytes} Sorted array of unsigned bytes 25 | */ 26 | var SortCountingUInt8 = function(inputArray) 27 | { 28 | var count = HistogramOneByteComponentUInt8(inputArray); 29 | 30 | var startIndex = 0; 31 | for (var countIndex = 0; countIndex < count.length; countIndex++) 32 | { 33 | inputArray.fill(countIndex, startIndex, startIndex + count[countIndex]); // 2X faster than using a for loop to fill an array 34 | startIndex += count[countIndex]; 35 | } 36 | return inputArray; 37 | } 38 | 39 | var HistogramOneWordComponent = function(inArray) 40 | { 41 | var numberOfBins = 65536; 42 | 43 | var count = new Array(numberOfBins); 44 | for (var b = 0; b < numberOfBins; b++) 45 | count[b] = 0; 46 | 47 | for (var current = 0; current < inArray.length; current++) 48 | count[ inArray[current] ]++; 49 | 50 | return count; 51 | } 52 | 53 | /** 54 | * Counting Sort of typed unsigned short array typed array 55 | * This algorithm is in-place 56 | * @param {Array of unsigned short} inputArray Array of numbers, which must be a typed array of unsigned short 57 | * @return {Array of unsigned short} Sorted array of unsigned short numbers 58 | */ 59 | var SortCountingUInt16 = function(inputArray) 60 | { 61 | var count = HistogramOneWordComponent(inputArray); 62 | 63 | var startIndex = 0; 64 | for (var countIndex = 0; countIndex < count.length; countIndex++) 65 | { 66 | inputArray.fill(countIndex, startIndex, startIndex + count[countIndex]); 67 | startIndex += count[countIndex]; 68 | } 69 | return inputArray; 70 | } 71 | 72 | return { 73 | SortCountingUInt8: SortCountingUInt8, 74 | SortCountingUInt16: SortCountingUInt16 75 | }; 76 | })(); 77 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | Apache License 2 | Version 2.0, January 2004 3 | http://www.apache.org/licenses/ 4 | 5 | TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 6 | 7 | 1. Definitions. 8 | 9 | "License" shall mean the terms and conditions for use, reproduction, 10 | and distribution as defined by Sections 1 through 9 of this document. 11 | 12 | "Licensor" shall mean the copyright owner or entity authorized by 13 | the copyright owner that is granting the License. 14 | 15 | "Legal Entity" shall mean the union of the acting entity and all 16 | other entities that control, are controlled by, or are under common 17 | control with that entity. For the purposes of this definition, 18 | "control" means (i) the power, direct or indirect, to cause the 19 | direction or management of such entity, whether by contract or 20 | otherwise, or (ii) ownership of fifty percent (50%) or more of the 21 | outstanding shares, or (iii) beneficial ownership of such entity. 22 | 23 | "You" (or "Your") shall mean an individual or Legal Entity 24 | exercising permissions granted by this License. 25 | 26 | "Source" form shall mean the preferred form for making modifications, 27 | including but not limited to software source code, documentation 28 | source, and configuration files. 29 | 30 | "Object" form shall mean any form resulting from mechanical 31 | transformation or translation of a Source form, including but 32 | not limited to compiled object code, generated documentation, 33 | and conversions to other media types. 34 | 35 | "Work" shall mean the work of authorship, whether in Source or 36 | Object form, made available under the License, as indicated by a 37 | copyright notice that is included in or attached to the work 38 | (an example is provided in the Appendix below). 39 | 40 | "Derivative Works" shall mean any work, whether in Source or Object 41 | form, that is based on (or derived from) the Work and for which the 42 | editorial revisions, annotations, elaborations, or other modifications 43 | represent, as a whole, an original work of authorship. For the purposes 44 | of this License, Derivative Works shall not include works that remain 45 | separable from, or merely link (or bind by name) to the interfaces of, 46 | the Work and Derivative Works thereof. 47 | 48 | "Contribution" shall mean any work of authorship, including 49 | the original version of the Work and any modifications or additions 50 | to that Work or Derivative Works thereof, that is intentionally 51 | submitted to Licensor for inclusion in the Work by the copyright owner 52 | or by an individual or Legal Entity authorized to submit on behalf of 53 | the copyright owner. For the purposes of this definition, "submitted" 54 | means any form of electronic, verbal, or written communication sent 55 | to the Licensor or its representatives, including but not limited to 56 | communication on electronic mailing lists, source code control systems, 57 | and issue tracking systems that are managed by, or on behalf of, the 58 | Licensor for the purpose of discussing and improving the Work, but 59 | excluding communication that is conspicuously marked or otherwise 60 | designated in writing by the copyright owner as "Not a Contribution." 61 | 62 | "Contributor" shall mean Licensor and any individual or Legal Entity 63 | on behalf of whom a Contribution has been received by Licensor and 64 | subsequently incorporated within the Work. 65 | 66 | 2. Grant of Copyright License. Subject to the terms and conditions of 67 | this License, each Contributor hereby grants to You a perpetual, 68 | worldwide, non-exclusive, no-charge, royalty-free, irrevocable 69 | copyright license to reproduce, prepare Derivative Works of, 70 | publicly display, publicly perform, sublicense, and distribute the 71 | Work and such Derivative Works in Source or Object form. 72 | 73 | 3. Grant of Patent License. Subject to the terms and conditions of 74 | this License, each Contributor hereby grants to You a perpetual, 75 | worldwide, non-exclusive, no-charge, royalty-free, irrevocable 76 | (except as stated in this section) patent license to make, have made, 77 | use, offer to sell, sell, import, and otherwise transfer the Work, 78 | where such license applies only to those patent claims licensable 79 | by such Contributor that are necessarily infringed by their 80 | Contribution(s) alone or by combination of their Contribution(s) 81 | with the Work to which such Contribution(s) was submitted. If You 82 | institute patent litigation against any entity (including a 83 | cross-claim or counterclaim in a lawsuit) alleging that the Work 84 | or a Contribution incorporated within the Work constitutes direct 85 | or contributory patent infringement, then any patent licenses 86 | granted to You under this License for that Work shall terminate 87 | as of the date such litigation is filed. 88 | 89 | 4. Redistribution. You may reproduce and distribute copies of the 90 | Work or Derivative Works thereof in any medium, with or without 91 | modifications, and in Source or Object form, provided that You 92 | meet the following conditions: 93 | 94 | (a) You must give any other recipients of the Work or 95 | Derivative Works a copy of this License; and 96 | 97 | (b) You must cause any modified files to carry prominent notices 98 | stating that You changed the files; and 99 | 100 | (c) You must retain, in the Source form of any Derivative Works 101 | that You distribute, all copyright, patent, trademark, and 102 | attribution notices from the Source form of the Work, 103 | excluding those notices that do not pertain to any part of 104 | the Derivative Works; and 105 | 106 | (d) If the Work includes a "NOTICE" text file as part of its 107 | distribution, then any Derivative Works that You distribute must 108 | include a readable copy of the attribution notices contained 109 | within such NOTICE file, excluding those notices that do not 110 | pertain to any part of the Derivative Works, in at least one 111 | of the following places: within a NOTICE text file distributed 112 | as part of the Derivative Works; within the Source form or 113 | documentation, if provided along with the Derivative Works; or, 114 | within a display generated by the Derivative Works, if and 115 | wherever such third-party notices normally appear. The contents 116 | of the NOTICE file are for informational purposes only and 117 | do not modify the License. You may add Your own attribution 118 | notices within Derivative Works that You distribute, alongside 119 | or as an addendum to the NOTICE text from the Work, provided 120 | that such additional attribution notices cannot be construed 121 | as modifying the License. 122 | 123 | You may add Your own copyright statement to Your modifications and 124 | may provide additional or different license terms and conditions 125 | for use, reproduction, or distribution of Your modifications, or 126 | for any such Derivative Works as a whole, provided Your use, 127 | reproduction, and distribution of the Work otherwise complies with 128 | the conditions stated in this License. 129 | 130 | 5. Submission of Contributions. Unless You explicitly state otherwise, 131 | any Contribution intentionally submitted for inclusion in the Work 132 | by You to the Licensor shall be under the terms and conditions of 133 | this License, without any additional terms or conditions. 134 | Notwithstanding the above, nothing herein shall supersede or modify 135 | the terms of any separate license agreement you may have executed 136 | with Licensor regarding such Contributions. 137 | 138 | 6. Trademarks. This License does not grant permission to use the trade 139 | names, trademarks, service marks, or product names of the Licensor, 140 | except as required for reasonable and customary use in describing the 141 | origin of the Work and reproducing the content of the NOTICE file. 142 | 143 | 7. Disclaimer of Warranty. Unless required by applicable law or 144 | agreed to in writing, Licensor provides the Work (and each 145 | Contributor provides its Contributions) on an "AS IS" BASIS, 146 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 147 | implied, including, without limitation, any warranties or conditions 148 | of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A 149 | PARTICULAR PURPOSE. You are solely responsible for determining the 150 | appropriateness of using or redistributing the Work and assume any 151 | risks associated with Your exercise of permissions under this License. 152 | 153 | 8. Limitation of Liability. In no event and under no legal theory, 154 | whether in tort (including negligence), contract, or otherwise, 155 | unless required by applicable law (such as deliberate and grossly 156 | negligent acts) or agreed to in writing, shall any Contributor be 157 | liable to You for damages, including any direct, indirect, special, 158 | incidental, or consequential damages of any character arising as a 159 | result of this License or out of the use or inability to use the 160 | Work (including but not limited to damages for loss of goodwill, 161 | work stoppage, computer failure or malfunction, or any and all 162 | other commercial damages or losses), even if such Contributor 163 | has been advised of the possibility of such damages. 164 | 165 | 9. Accepting Warranty or Additional Liability. While redistributing 166 | the Work or Derivative Works thereof, You may choose to offer, 167 | and charge a fee for, acceptance of support, warranty, indemnity, 168 | or other liability obligations and/or rights consistent with this 169 | License. However, in accepting such obligations, You may act only 170 | on Your own behalf and on Your sole responsibility, not on behalf 171 | of any other Contributor, and only if You agree to indemnify, 172 | defend, and hold each Contributor harmless for any liability 173 | incurred by, or claims asserted against, such Contributor by reason 174 | of your accepting any such warranty or additional liability. 175 | 176 | END OF TERMS AND CONDITIONS 177 | 178 | APPENDIX: How to apply the Apache License to your work. 179 | 180 | To apply the Apache License to your work, attach the following 181 | boilerplate notice, with the fields enclosed by brackets "[]" 182 | replaced with your own identifying information. (Don't include 183 | the brackets!) The text should be enclosed in the appropriate 184 | comment syntax for the file format. We also recommend that a 185 | file or class name and description of purpose be included on the 186 | same "printed page" as the copyright notice for easier 187 | identification within third-party archives. 188 | 189 | Copyright [yyyy] [name of copyright owner] 190 | 191 | Licensed under the Apache License, Version 2.0 (the "License"); 192 | you may not use this file except in compliance with the License. 193 | You may obtain a copy of the License at 194 | 195 | http://www.apache.org/licenses/LICENSE-2.0 196 | 197 | Unless required by applicable law or agreed to in writing, software 198 | distributed under the License is distributed on an "AS IS" BASIS, 199 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 200 | See the License for the specific language governing permissions and 201 | limitations under the License. 202 | -------------------------------------------------------------------------------- /RadixSort.js: -------------------------------------------------------------------------------- 1 | // TODO: Remove extract digit function and just inline the core code. I've seen this improve performance in C#. Not sure how agressively JavaScript inlines small functions. 2 | // TODO: Compare performance versus TimSort for random, pre-sorted and constant, since TimSort is available in JavaScript thru npm 3 | // (https://stackoverflow.com/questions/40721767/what-is-the-fastest-way-to-sort-a-largeish-array-of-numbers-in-javascript) 4 | // TODO: Compare performance with the following: 5 | // var numArray = new Uint32Array([140000, 104, 99]); 6 | // numArray = numArray.sort(); 7 | // alert(numArray) 8 | // TODO: Consider handling these cases as JavaScript .sort does 9 | // array = [3, 5, -1, 1, NaN, 6, undefined, 2, null] 10 | // array.sort((a,b) => isNaN(a) || a-b) 11 | // [-1, null, 1, 2, 3, 5, 6, NaN, undefined] 12 | 13 | var HpcAlgorithms = HpcAlgorithms || {}; 14 | 15 | HpcAlgorithms.Sorting = (function() 16 | { 17 | var internalState = "Message"; 18 | 19 | var privateMethod = function() { 20 | // Do private stuff, or build internal. 21 | return internalState; 22 | }; 23 | var publicMethod = function() { 24 | return privateMethod() + " stuff"; 25 | }; 26 | 27 | var extractDigit = function( a, bitMask, shiftRightAmount ) 28 | { 29 | var digit = (a & bitMask) >>> shiftRightAmount; // extract the digit we are sorting based on 30 | return digit; 31 | } 32 | 33 | var HistogramByteComponents = function(inArray, l, r) 34 | { 35 | var numberOfDigits = 4; 36 | var numberOfBins = 256; 37 | 38 | var count = new Array(numberOfDigits); 39 | for (var d = 0; d < numberOfDigits; d++) 40 | { 41 | count[d] = new Array(numberOfBins); 42 | for (var b = 0; b < numberOfBins; b++) 43 | count[d][b] = 0; 44 | } 45 | 46 | for (var current = l; current <= r; current++) // Scan the array and count the number of times each digit value appears - i.e. size of each bin 47 | { 48 | var value = inArray[current]; 49 | count[0][ value & 0xff]++; 50 | count[1][(value >> 8) & 0xff]++; 51 | count[2][(value >> 16) & 0xff]++; 52 | count[3][(value >> 24) & 0xff]++; 53 | } 54 | return count; 55 | } 56 | 57 | var HistogramByteComponentsAndKeyArray = function(inArray, l, r, getKey) 58 | { 59 | var numberOfDigits = 4; 60 | var numberOfBins = 256; 61 | var inKeys = new Array(inArray.length); 62 | 63 | var count = new Array(numberOfDigits); 64 | for (var d = 0; d < numberOfDigits; d++) 65 | { 66 | count[d] = new Array(numberOfBins); 67 | for (var b = 0; b < numberOfBins; b++) 68 | count[d][b] = 0; 69 | } 70 | 71 | for (var current = l; current <= r; current++) // Scan the array and count the number of times each digit value appears - i.e. size of each bin 72 | { 73 | var value = getKey(inArray[current]); 74 | inKeys[current] = value; 75 | count[0][ value & 0xff]++; 76 | count[1][(value >> 8) & 0xff]++; 77 | count[2][(value >> 16) & 0xff]++; 78 | count[3][(value >> 24) & 0xff]++; 79 | } 80 | return { 81 | count: count, 82 | inKeys: inKeys 83 | }; 84 | } 85 | 86 | /** 87 | * Radix Sort (Least Significant Digit - LSD) of unsigned integer array with values up to 32-bits (e.g. 0, 1, 2, ... 2_000_000_000, ...) 88 | * This algorithm is not in-place - i.e. returns a sorted array 89 | * @param {Array of numbers} inputArray Array of numbers, which must be unsigned integers of values within 32-bits 90 | * @return {Array of numbers} Sorted array of numbers 91 | */ 92 | var RadixSortLsdUInt32 = function(inputArray) 93 | { 94 | if (typeof inputArray.constructor === Array && typeof inputArray[0] === "number") throw new TypeError("Input argument must be an array of unsigned integers"); 95 | var numberOfBins = 256; 96 | var numberOfDigits = 4; 97 | var Log2ofPowerOfTwoRadix = 8; 98 | var outputArrayHasResult = false; 99 | var bitMask = 255; 100 | var shiftRightAmount = 0; 101 | var outputArray = new Array(inputArray.length); 102 | 103 | var count = HistogramByteComponents(inputArray, 0, inputArray.length - 1); 104 | 105 | var startOfBin = new Array(numberOfDigits); 106 | var d = 0; 107 | for (d = 0; d < numberOfDigits; d++) 108 | { 109 | startOfBin[d] = new Array(numberOfBins); 110 | startOfBin[d][0] = 0; 111 | for (var b = 1; b < numberOfBins; b++ ) 112 | startOfBin[d][b] = startOfBin[d][b - 1] + count[d][b - 1]; 113 | } 114 | 115 | d = 0; 116 | while( bitMask != 0 ) // end processing digits when all the mask bits have been processed and shifted out, leaving no bits set in the bitMask 117 | { 118 | var startOfBinLoc = startOfBin[d]; 119 | for ( var current = 0; current < inputArray.length; current++ ) 120 | outputArray[ startOfBinLoc[ (inputArray[ current ] & bitMask) >>> shiftRightAmount ]++ ] = inputArray[ current ]; 121 | 122 | bitMask <<= Log2ofPowerOfTwoRadix; 123 | shiftRightAmount += Log2ofPowerOfTwoRadix; 124 | outputArrayHasResult = !outputArrayHasResult; 125 | d++; 126 | 127 | var tmp = inputArray, inputArray = outputArray, outputArray = tmp; // swap input and output arrays 128 | } 129 | 130 | return outputArrayHasResult ? outputArray : inputArray;; 131 | } 132 | 133 | /** 134 | * Radix Sort (Least Significant Digit - LSD) of user defined type/class array based on a key that is a 32-bit unsigned integer (e.g. 0, 1, 2, ... 2_000_000_000, ...) 135 | * This algorithm is not in-place - i.e. returns a sorted array. This algorithm is stable. 136 | * @param {Array} inputArray user defined type/class (UDT) array with each element containing a key that is a 32-bit unsigned integer 137 | * @param {function} getKey function to extract and return a numeric key from the user defined type/class to sort on 138 | * @return {Array of numbers} Sorted array of a user defined type 139 | */ 140 | function RadixSortLsdUdtUInt32(inputArray, getKey) { 141 | var numberOfBitsPerDigit = 8; 142 | var numberOfBins = 1 << numberOfBitsPerDigit; 143 | var numberOfDigits = 4; 144 | var outputArray = new Array(inputArray.length); 145 | var outSortedKeys = new Array(inputArray.length); 146 | var outputArrayHasResult = false; 147 | var bitMask = numberOfBins - 1; 148 | var shiftRightAmount = 0; 149 | var d = 0; 150 | 151 | var retValue = HistogramByteComponentsAndKeyArray(inputArray, 0, inputArray.length - 1, getKey); 152 | var count = retValue.count; 153 | var inKeys = retValue.inKeys; 154 | 155 | var startOfBin = new Array(numberOfDigits); 156 | for (d = 0; d < numberOfDigits; d++) 157 | { 158 | startOfBin[d] = new Array(numberOfBins); 159 | startOfBin[d][0] = 0; 160 | for (var b = 1; b < numberOfBins; b++ ) 161 | startOfBin[d][b] = startOfBin[d][b - 1] + count[d][b - 1]; 162 | } 163 | 164 | d = 0; 165 | while( bitMask != 0 ) // end processing digits when all the mask bits have been processed and shifted out, leaving no bits set in the bitMask 166 | { 167 | var startOfBinLoc = startOfBin[d]; 168 | 169 | for (var current = 0; current < inputArray.length; current++) 170 | { 171 | var endOfBinIndex = (inKeys[current] & bitMask) >> shiftRightAmount; 172 | var index = startOfBinLoc[endOfBinIndex]; 173 | outputArray[ index] = inputArray[current]; 174 | outSortedKeys[index] = inKeys[ current]; 175 | startOfBinLoc[endOfBinIndex]++; 176 | } 177 | 178 | bitMask <<= numberOfBitsPerDigit; 179 | shiftRightAmount += numberOfBitsPerDigit; 180 | outputArrayHasResult = !outputArrayHasResult; 181 | d++; 182 | 183 | var tmp = inputArray, inputArray = outputArray, outputArray = tmp; // swap input and output arrays 184 | var tmpKeys = inKeys; inKeys = outSortedKeys; outSortedKeys = tmpKeys; // swap input and output key arrays 185 | } 186 | 187 | return outputArrayHasResult ? outputArray : inputArray; 188 | } 189 | 190 | return { 191 | //someProperty: 'prop value', 192 | RadixSortLsdUInt32: RadixSortLsdUInt32, 193 | RadixSortLsdUdtUInt32: RadixSortLsdUdtUInt32 194 | }; 195 | })(); 196 | -------------------------------------------------------------------------------- /package.json: -------------------------------------------------------------------------------- 1 | { 2 | "name": "hpc-algorithms", 3 | "version": "1.0.5", 4 | "description": "High Performance Computing Algorithms", 5 | "main": "RadixSort.js", 6 | "scripts": { 7 | "test": "echo \"Error: no test specified\" && exit 1" 8 | }, 9 | "author": "Victor J. Duvanenko", 10 | "repository": { 11 | "type": "git", 12 | "url": "https://github.com/DragonSpit/hpc-algorithms" 13 | }, 14 | "bugs": { 15 | "email": "vduvanenko1@gmail.com" 16 | }, 17 | "license": "Apache 2.0", 18 | "keywords": [ 19 | "sorting", 20 | "sort", 21 | "fast sort", 22 | "fast sorting", 23 | "faster sorting", 24 | "radix sort", 25 | "algorithm", 26 | "algorithms", 27 | "fast algorithm", 28 | "faster algorithms", 29 | "high performance", 30 | "high performance computing" 31 | ] 32 | } 33 | -------------------------------------------------------------------------------- /readme.md: -------------------------------------------------------------------------------- 1 | If you like hpc-algorithms, then help us keep more good stuff like this coming.\ 2 | Let us know what other algorithms could use acceleration or improvement. 3 | 4 | [![paypal](https://www.paypalobjects.com/en_US/i/btn/btn_donateCC_LG.gif)](https://www.paypal.com/cgi-bin/webscr?cmd=_s-xclick&hosted_button_id=LDD8L7UPAC7QL) 5 | 6 | # High Performance Computing Algorithms in JavaScript 7 | 8 | Faster and Better Algorithms, starting with high performance sorting: 9 | - 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. 10 | 5-10X faster for arrays greater than 35 Million. This sort algorithm is not in-place, returning a new sorted array. 11 | Discussion, benchmarks and usage in https://duvanenko.tech.blog/2017/06/15/faster-sorting-in-javascript/ 12 | - LSD Radix Sort for arrays of objects by an unsigned integer key. 15X faster than JavaScript's built-in .sort(). 13 | This is a stable sort, while JavaScript built-in is not stable. This sort algorithm is not in-place, returning a new sorted array. 14 | Discussion, benchmarks and usage in https://duvanenko.tech.blog/2017/07/10/sorting-arrays-of-objects-in-javascript-with-radix-sort/ 15 | - Counting Sort for Uint8 and Uint16 typed arrays. 40X faster for Uint8 arrays and 15X faster for Uint16 arrays. 16 | This sort algorithm is in-place. 17 | 18 | When you benchmark these algorithms keep in mind that for the first few runs the basic JavaScript JIT compiler is used, providing fast 19 | start up time and giving time for the optimizing compiler to run. After these few runs the optimized code starts being used, 20 | 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 21 | for more details about the JIT engine in Chrome. 22 | 23 | # Examples 24 | 25 | ```javascript 26 | function simpleUsageExampleOfRadixSortLSD() { 27 | var arrayToBeSorted = [ 99, 1999999999, 51, 23, 102]; 28 | var sortedArray = HpcAlgorithms.Sorting.RadixSortLsdUInt32(arrayToBeSorted); 29 | for ( var _current = 0; _current < sortedArray.length; _current++ ) { 30 | console.log(sortedArray[_current]); 31 | } 32 | } 33 | ``` 34 | 35 | If you have other specific needs for higher performance algorithms, let us know. 36 | --------------------------------------------------------------------------------