Question

चयन (Selection) सॉर्टिग क्या है?

Answer 1

Answer:

In computer science, selection sort is a sorting algorithm, specifically an in-place comparison sort. It has O time complexity, making it inefficient on large lists, and generally performs worse than the similar insertion sort.

Worst complexity: n^2

Average complexity: n^2

Best complexity: n^2

Space complexity: 1

Method: Selection

Stable: No

Class: Comparison sort

Explanation:

follow me

Answer 2

Explanation:

The selection sort is a combination of searching and sorting. During each pass, the unsorted element with the smallest (or largest) value is moved to its proper position in the array. The number of times the sort passes through the array is one less than the number of items in the array.