which of these are basic steps for performing selection sort
Answers
Answered by
0
Basic steps for performing selection sort
Explanation:
- In computer science selection sort is the procedure of the in place comparison sorting algorithm.
- It consists time complexity such as O(n2) . It makes it inefficient at the large scale and generally have worse performance in the insertion sort.
- Selection sort is known for its simplicity and perform in advantage over the complication of algorithm.
- It is divided into two parts
- It is of different type Bubble sort, Insertion sort, Quick sort, Merge sort, Heap sort, Selection.
- Steps:
- Get the list of unsorted numbers.
- Make a set for unsorted numbers at front list
- Repeat the step 4 and 5
- T o compare all unsorted numbers in comparison to select smallest numbers.
- Now swap that number with the first number that is unsorted.
Learn more: Swap, unsorted numbers.
https://brainly.in/question/17659445
Similar questions