mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-27 23:11:09 +00:00
Code Issues Packages Projects Releases Wiki Activity

edit

vinayak 2020-01-24 10:30:06 +05:30
parent 6497dbe689
commit 2ec1fcc367
1 changed files with 75 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

83
Sorting-Algorithms.md

@ -1,26 +1,91 @@
# Bubble sort: <h1>index</h1>
![bubblesort](https://camo.githubusercontent.com/40b8099e638526dce298f8dc91246173d56e389a/68747470733a2f2f75706c6f61642e77696b696d656469612e6f72672f77696b6970656469612f636f6d6d6f6e732f7468756d622f382f38332f427562626c65736f72742d6564697465642d636f6c6f722e7376672f32323070782d427562626c65736f72742d6564697465642d636f6c6f722e7376672e706e67) <br/>
<ol>
<li><a href="">Selection Sort</a></li>
<li><a href="">Bubble Sort</a></li>
<li><a href="">Recursive Bubble Sort</a></li>
<li><a href="">Insertion Sort</a></li>
<li><a href="">Recursive Insertion Sort</a></li>
<li><a href="">Merge Sort</a></li>
<li><a href="">Iterative Merge Sort</a></li>
<li><a href="">Quick Sort</a></li>
<li><a href="">Iterative Quick Sort</a></li>
<li><a href="">Heap Sort</a></li>
<li><a href="">Counting Sort</a></li>
<li><a href="">Radix Sort</a></li>
<li><a href="">Bucket Sort</a></li>
<li><a href="">ShellSort</a></li>
<li><a href="">TimSort</a></li>
<li><a href="">Comb Sort</a></li>
<li><a href="">Pigeonhole Sort</a></li>
<li><a href="">Cycle Sort</a></li>
<li><a href="">Cocktail Sort</a></li>
<li><a href="">Strand Sort</a></li>
<li><a href="">Bitonic Sort</a></li>
<li><a href="">Pancake sorting</a></li>
<li><a href="">Binary Insertion Sort</a></li>
<li><a href="">BogoSort or Permutation Sort</a></li>
<li><a href="">Gnome Sort</a></li>
<li><a href="">Sleep Sort – The King of Laziness / Sorting while Sleeping</a></li>
<li><a href="">Structure Sorting (By Multiple Rules) </a></li>
<li><a href="">Stooge Sort</a></li>
<li><a href="">Tag Sort (To get both sorted and original)</a></li>
<li><a href="">Tree Sort</a></li>
<li><a href="">Cartesian Tree Sorting</a></li>
<li><a href="">Odd-Even Sort / Brick Sort</a></li>
<li><a href="">QuickSort on Singly Linked List</a></li>
<li><a href="">QuickSort on Doubly Linked List</a></li>
<li><a href="">3-Way QuickSort (Dutch National Flag)</a></li>
<li><a href="">Merge Sort for Linked Lists</a></li>
<li><a href="">Merge Sort for Doubly Linked List</a></li>
<li><a href="">3-way Merge Sort</a></li>
</ol>
***
<h2>Selection sort</h2>
**selection sort**, algorithm sorts an array by repeatedly finding the minimum element (considering ascending order) from the unsorted part and putting it at the beginning. The algorithm maintains two subarrays in a given array.
<ol>
<li> The subarray which is already sorted.</li>
<li> Remaining subarray which is unsorted.</li>
In every iteration of selection sort, the minimum element (considering ascending order) from the unsorted subarray is picked and moved to the sorted subarray.
#### Properties:
- Worst-case performance O(n^2)
- Best-case performance O(n)
- Average case performance O(n^2)
**read more at: [Wikipedia](https://en.wikipedia.org/wiki/Selection_sort)**<br>
**code: [Bubble sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/selection_sort.py)**
***
<h2>Bubble sort</h2>
**Bubble sort**, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted. The algorithm, which is a comparison sort, is named for the way smaller elements "bubble" to the top of the list. Although the algorithm is simple, it is too slow and impractical for most problems even when compared to insertion sort. It can be practical if the input is usually in sorted order but may occasionally have some out-of-order elements nearly in position. **Bubble sort**, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted. The algorithm, which is a comparison sort, is named for the way smaller elements "bubble" to the top of the list. Although the algorithm is simple, it is too slow and impractical for most problems even when compared to insertion sort. It can be practical if the input is usually in sorted order but may occasionally have some out-of-order elements nearly in position.
#### Properties: #### Properties:
- Worst case performance O(n^2) - Worst-case performance O(n^2)
- Best case performance O(n) - Best-case performance O(n)
- Average case performance O(n^2) - Average case performance O(n^2)
**read more at: [Wikipedia](https://en.wikipedia.org/wiki/Bubble_sort)**<br> **read more at: [Wikipedia](https://en.wikipedia.org/wiki/Bubble_sort)**<br>
**code: [Bubble sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/bubble_sort.py)** **code: [Bubble sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/bubble_sort.py)**
***
# Insertion sort:
![insertionsort] <h2>Insertion sort</h2>
(https://camo.githubusercontent.com/a7657e625281b63ca552a40c099c9331ce79f6a1/68747470733a2f2f75706c6f61642e77696b696d656469612e6f72672f77696b6970656469612f636f6d6d6f6e732f372f37652f496e73657274696f6e736f72742d6564697465642e706e67)
**Insertion sort** is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort. **Insertion sort** is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.
#### Properties: #### Properties:
- Worst case performance O(n^2) - Worst-case performance O(n^2)
- Best case performance O(n) - Best-case performance O(n)
- Average case performance O(n^2) - Average case performance O(n^2)
**read more at: [Wikipedia](https://en.wikipedia.org/wiki/Insertion_sort)**<br> **read more at: [Wikipedia](https://en.wikipedia.org/wiki/Insertion_sort)**<br>