Selection Sort in 2 min (Python)

Hi everyone! In this video, I will explain selection sort with two easy examples with input arrays. Then, I will go through the code in selection sort with Python.

Selection sort is one of the easiest algorithms used for sorting numbers in an array. It has the worst case time complexity of O(n^2), where n is the size of the array to be sorted. Pretty much all computer science students will learn to sort through numbers in the Data Structures and Algorithms course, just like selection sort. However, it is not the fastest sorting technique, as quick sort is way more efficient and faster.

In the next video, I will go over insertion sort, then bubble sort, then merge sort, and finally quick sort, respectively.

Please leave a like and subscribe if you found this video helpful!

LIKE & SUBSCRIBE:

MY EQUIPMENT:
✅Camera: Samsung Galaxy J7
✅Editing Software: Shotcut