Computer Science, asked by soumjoshi273, 10 months ago

what is section sort​

Answers

Answered by Tashvith07
0

Answer:

computer science, selection sort is a sorting algorithm, specifically an in-place comparison sort. It has O(n2) time complexity, making it inefficient on large lists, and generally performs worse than the similar insertion sort. Selection sort is noted for its simplicity, and it has performance advantages over more complicated algorithms in certain situations, particularly where auxiliary memory is limited.

Answered by ItzDevilQueen07
6

Answer:

A sort algorithm that repeatedly searches remaining items to find the least one and moves it to its final location. The run time is Θ(n²), where n is the number of elements. The number of swaps is O(n).

Explanation:

hey mate I hope it helpzzz u

mark as brainliest plz

Similar questions