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 bucket sort

The bucket sort algorithm (also known as bin sort) is also a distributed sorting algorithm that separates the elements into different buckets (smaller arrays), and then uses a simpler sorting algorithm, such as the insertion sort (a good algorithm for small arrays), to sort each bucket. It then merges all the buckets into the resultant sorted array.

The following code represents the bucket sort algorithm:

function bucketSort(array, bucketSize = 5) { // {1}  if (array.length < 2) {    return array;  }  const buckets = createBuckets(array, bucketSize); // {2}  return sortBuckets(buckets); // {3}}

For the bucket sort algorithm, we need to specify how many buckets will be used to sort the elements ({1}). By default, we will use 5 buckets. ...

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