Skip to Content
Learning JavaScript Data Structures and Algorithms - Third Edition
book

Learning JavaScript Data Structures and Algorithms - Third Edition

by Loiane Avancini
April 2018
Beginner to intermediate content levelBeginner to intermediate
426 pages
10h 19m
English
Packt Publishing
Content preview from Learning JavaScript Data Structures and Algorithms - Third Edition

The radix sort

The radix sort algorithm is also a distribution sort algorithm that distributes the integers into buckets based on a number's significant digit or value (the radix, hence the name radix sort). The radix is based on the number system of the values of the arrays.

For example, for numbers of the decimal system, radix 10 is used; therefore, the algorithm is going to use 10 buckets to distribute the elements and will first sort the numbers based on the 1s, then 10s, then 100s, and so on.

The following code represents the radix sort algorithm:

function radixSort(array, radixBase = 10) {  if (array.length < 2) {    return array;  }  const minValue = findMinValue(array);  const maxValue = findMaxValue(array); let significantDigit = 1; // ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Learning JavaScript Data Structures and Algorithms

Learning JavaScript Data Structures and Algorithms

Loiane Avancini

Publisher Resources

ISBN: 9781788623872Supplemental Content