Last active
August 26, 2023 12:46
-
-
Save anurag-roy/30f41c743180cd39dad70992811dee97 to your computer and use it in GitHub Desktop.
Efficiently insert a number to an already sorted array of numbers. Can easily be extended for other types or objects.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
export const getPositionToInsert = ( | |
numbers: number[], | |
numberToInsert: number | |
) => { | |
if (numberToInsert < numbers[0]) return 0; | |
if (numberToInsert > numbers[numbers.length - 1]) return numbers.length; | |
const getIndex = (start: number, end: number): number => { | |
if (numbers[start] === numberToInsert) return start; | |
if (numbers[end] === numberToInsert) return end; | |
const middle = start + Math.floor((end - start) / 2); | |
if (middle === start) return -1; | |
const middleNumber = numbers[middle]; | |
if (middleNumber === numberToInsert) return middle; | |
else if (numberToInsert > middleNumber) return getIndex(middle, end); | |
else return getIndex(start, middle); | |
}; | |
return getIndex(0, numbers.length); | |
}; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import { getPositionToInsert } from './insert.ts'; | |
const TEST_LENGTH = 100_000; | |
const numbers1: number[] = []; | |
const numbers2: number[] = []; | |
for (let i = 0; i < TEST_LENGTH; i++) { | |
numbers1.push(i); | |
numbers2.push(i); | |
} | |
const randomNumber = Math.floor(Math.random() * TEST_LENGTH); | |
Deno.bench('Insert then sort', () => { | |
numbers1.push(randomNumber); | |
numbers1.sort(); | |
}); | |
Deno.bench('Insert in precise position', () => { | |
const positionToInsert = getPositionToInsert(numbers2, randomNumber); | |
numbers2.splice(positionToInsert, 0, randomNumber); | |
}); |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Benchmarks (100,000 items):