KO | EN

GitLite

Minimalist Open Source Repository Search Engine

gitlite — search

#developer-tools #typescript #claude-code #codex #dsh #dsh-plugin #ai-agent #ai-agents #deepseek-harness #agent-skills #macos #cli

Python_Sorting_Algorithms

★ 25 Open GitHub ↗

Python - Sorting Algorithms

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# Welcome to Sorting-Algorithm Repository!

**Sorting**  is a skill that every  **software engineer**  and  **developer**  needs some knowledge of. Not only to pass coding interviews but as a general understanding of programming itself. The different sorting algorithms are a perfect showcase of how algorithm design can have such a strong effect on program complexity, speed, and efficiency.

# Selection Sort

**Selection sort** is also quite simple but frequently outperforms bubble sort. If you are choosing between the two, it’s best to just default right to selection sort. With Selection sort, we divide our input list / array into two parts: the sublist of items already sorted and the sublist of items remaining to be sorted that make up the rest of the list. We first find the smallest element in the unsorted sublist and place it at the end of the sorted sublist. Thus, we are continuously grabbing the smallest unsorted element and placing it in sorted order in the sorted sublist. This process continues iteratively until the list is fully sorted.
           ![enter image description here](https://a.top4top.io/p_1741bco6x1.gif)

>     to see the code open/run Selection_Sort.py
>     Python3 Selection_Sort.py

##  Insertion Sort

Insertion sort is both faster and well-arguably more simplistic than both bubble sort and selection sort. Funny enough, it’s how many people sort their cards when playing a card game! On each loop iteration, insertion sort removes one element from the array. It then finds the location where that element belongs within another  _sorted_  array and inserts it there. It repeats this process until no input elements remain.
																![enter image description here](https://c.top4top.io/p_1741u2v4h1.gif)

> to see the code open/run Insertion_Sort.py
    > Python3 Insertion_Sort.py

##  Merge Sort
Merge sort is a perfectly elegant example of a Divide and Conquer algorithm. It simple uses the 2 main steps of such an algorithm:

(1) Continuously  _divide_ the unsorted list until you have  _N_  sublists, where each sublist has 1 element that is “unsorted” and  _N_ is the number of elements in the original array.

(2) Repeatedly  [merge](https://en.wikipedia.org/wiki/Merge_algorithm)  i.e  _conquer_ the sublists together 2 at a time to produce new sorted sublists until all elements have been fully merged into a single sorted array.
![enter image description here](https://f.top4top.io/p_1741h1u631.gif)

>     > to see the code open/run Merge_Sort.py
>     > Python3 Merge_Sort.py

## Quick Sort

Like  [Merge Sort](https://en.wikipedia.org/wiki/Merge_algorithm), **QuickSort** is a Divide and Conquer algorithm. It picks an element as pivot and partitions the given array around the picked pivot. There are many different versions of quickSort that pick pivot in different ways.

1.  Always pick first element as pivot.
2.  Always pick last element as pivot (implemented below)
3.  Pick a random element as pivot.
4.  Pick median as pivot.

The key process in quickSort is partition(). Target of partitions is, given an array and an element x of array as pivot, put x at its correct position in sorted array and put all smaller elements (smaller than x) before x, and put all greater elements (greater than x) after x. All this should be done in linear time.
![enter image description here](https://f.top4top.io/p_1741h1u631.gif)
>     > to see the code open/run Quick_Sort.py
>     > Python3 Quick_Sort.py

Python_Sorting_Algorithms

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README