Selection Sort Algorithm
Selection sort is a comparison sorting algorithm with quadratic (n^2) time complexity. It’s famous for its simplicity and as it’s an in-place sorting algorithm, it can perform on limited memory. However, it becomes inefficient when the size of data grows.
The algorithm divides the input into a sorted and unsorted sublist. Each iteration finds the minimum of the unsorted sublist and swaps it with the first element. It continues until the unsorted sublist becomes empty.
In this video, we talk about selection sort, implement it in Python and analyse its time complexity.
Chapters:
0:00 Introduction
1:08 Code [Python]
1:45 Run
2:57 Time Complexity
3:42 Thank You
___________________________________
Music from Free To Use Music
Track: Joy by Limujii
• Limujii - Joy [FTUM Release] · Energetic U...
___________________________________
On this page of the site you can watch the video online Selection Sort Algorithm with a duration of hours minute second in good quality, which was uploaded by the user BigOCast 08 May 2022, share the link with friends and acquaintances, this video has already been watched 602 times on youtube and it was liked by 14 viewers. Enjoy your viewing!
