Skip to content

Sorting Algorithms in Python: Bubble Sort, Selection Sort, Insertion Sort, Quick Sort, Merge Sort, Heap Sort

Notifications You must be signed in to change notification settings

RefaelBeker7/Sorting-Algorithms-Python

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

14 Commits
 
 
 
 
 
 

Repository files navigation

Sorting-Algorithms-Python

Sorting Algorithms in Python: Bubble Sort, Selection Sort, Insertion Sort, Quick Sort, Merge Sort, Heap Sort

forthebadge

While it's beneficial to understand these sorting algorithms, in most Python projects you would probably use the sort functions already provided in the language.

Conclusion

Sorting algorithms gives us many ways to order our data. We looked at 6 different algorithms:

  • Bubble Sort.
  • Selection Sort.
  • Insertion Sort.
  • Quick Sort.
  • Merge Sort.
  • Heap Sort.

The amount of comparison and swaps the algorithm performs along with the environment the code runs are key determinants of performance. In real Python applications, it's recommended we stick with the built in Python sort functions for their flexibility on the input and speed.

About

Sorting Algorithms in Python: Bubble Sort, Selection Sort, Insertion Sort, Quick Sort, Merge Sort, Heap Sort

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages