Searches

Algorithms for identification of a single element on a linear collection of arbitrary elements according to the specified rules.

Import alias 'ads-js/searches'

Table of contents

Binary search - implementation of a search algorithm on a sorted array which looks up for the specified value by repeatedly dividing the search interval in half.

Quick select - implementation of a selection algorithm on an unsorted array related to the quicksort sorting algorithm which finds the nth smallest element in O(n) average time.