Merge branch 'main' of https://github.com/ForeignGods/Sorting-Algorithms-Blender
This commit is contained in:
commit
9c7a5e29a1
@ -15,6 +15,7 @@ Table of contents
|
||||
* [Bubble Sort](#bubble-sort)
|
||||
* [Insertion Sort](#insertion-sort)
|
||||
* [Selection Sort](#selection-sort)
|
||||
* [Heap Sort](#heap-sort)
|
||||
* [Shell Sort](#shell-sort)
|
||||
* [Merge Sort](#merge-sort)
|
||||
* [Quick Sort](#quick-sort)
|
||||
@ -113,6 +114,13 @@ The selection sort algorithm sorts an array by repeatedly finding the minimum el
|
||||
| ------------- |:-------------:|
|
||||
|||
|
||||
|
||||
|
||||
## Heap Sort
|
||||
|
||||
|<a href="https://github.com/ForeignGods/Sorting-Algorithms-Blender/blob/main/sort_scale/heap_sort_scale.py" target="_blank">heap_sort_scale.py</a>|<a href="https://github.com/ForeignGods/Sorting-Algorithms-Blender/blob/main/sort_color/heap_sort_color.py" target="_blank">heap_sort_color.py</a>|
|
||||
| ------------- |:-------------:|
|
||||
|||
|
||||
|
||||
## Shell Sort
|
||||
<p>
|
||||
The shell sort algorithm extends the insertion sort algorithm and is very efficient in sorting widely unsorted arrays.<br>
|
||||
|
Loading…
x
Reference in New Issue
Block a user