Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Create insertion_sort.py #208

Open
wants to merge 2 commits into
base: main
Choose a base branch
from
Open

Create insertion_sort.py #208

wants to merge 2 commits into from

Conversation

nanto88
Copy link

@nanto88 nanto88 commented Oct 28, 2020

Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time.
So in beginning we compare the first two elements and sort them by comparing them.
Then we pick the third element and find its proper position among the previous two sorted elements.
This way we gradually go on adding more elements to the already sorted list by putting them in their proper position.

Thanks for review this code

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant