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

The selection sort algorithm is an in-place comparison sort algorithm. The general idea of the selection sort is to find the minimum value in the data structure, place it in the first position, then find the second minimum value, place it in the second position, and so on.

The following is the source code for the selection sort algorithm:

function selectionSort(array, compareFn = defaultCompare) {  const { length } = array; // {1}   let indexMin;  for (let i = 0; i < length - 1; i++) { // {2}    indexMin = i; // {3}    for (let j = i; j < length; j++) { // {4}      if (compareFn(array[indexMin], array[j]) === Compare.BIGGER_THAN) { // {5}        indexMin = j; // {6}      }    }    if (i !== indexMin) { // {7}      swap(array, i, indexMin);    }  } return array; ...
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