Understanding Selection Sort Algorithm In Data Structures

In this video, we are going to start a new topic: selection sorting.

We’ll talk about selection sort in this video

selection Sort is an In-Place sorting algorithm.

The selection sort algorithm sorts an array by repeatedly finding the minimum element (considering ascending order) from unsorted part and putting it at the beginning. The algorithm maintains two sub arrays in a given array.
The sub array which is already sorted.
Remaining sub array which is unsorted.

In every iteration of selection sort, the minimum element (considering ascending order) from the unsorted sub array is picked and moved to the sorted sub array.

In this video, you’ll also learn about asymptotic notations, they are basically mathematical notations which represent order of growth of any mathematical function. There are three famous notations which you’ll see in this video, they are big O , Theta , Omega.

Welcome to the first video Tutorial on Data Structures And Algorithms. In this video I am going to provide an Introduction to Data Structures And Algorithms. This Course is created to Explain the Fundamentals of data structures and algorithms. This video Will explain What is data?, What is data structure?, The Need for Data Structures, What is algorithm?

#DataStructures #Algorithms #DSandAlgo #ProgrammingKnowledge

★★★Top Online Courses From ProgrammingKnowledge ★★★

★★★ Online Courses to learn ★★★

★★★ Follow ★★★

DISCLAIMER: This video and description contains affiliate links, which means that if you click on one of the product links, I’ll receive a small commission. This help support the channel and allows us to continue to make videos like this. Thank you for the support!