This repository was archived by the owner on Oct 5, 2025. It is now read-only.
insertionSort.js added#402
Open
Prasadkandekar wants to merge 2 commits intoHarshwardhanPatil07:mainfrom
Open
Conversation
This file contains hidden or 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
Sign up for free
to subscribe to this conversation on GitHub.
Already have an account?
Sign in.
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
How Insertion Sort Works works:
The outer loop goes through the array starting from index 1.
The inner loop compares the current element (key) with the elements before it and shifts the larger elements one position to the right.
The key is inserted into its correct position once the proper place is found.
The time complexity of this algorithm is
𝑂(𝑛2)
O(n 2) in the worst and average cases, where 𝑛n is the number of elements in the array.