Question

Describe selection sort in data structure

Answer 1

Data Structure and Algorithms Selection Sort. Selection sort is a simple sortingalgorithm. ... Initially, the sorted part is empty and the unsorted part is the entire list. The smallest element is selected from the unsorted array and swapped with the leftmost element, and that element becomes a part of the sorted array.

Answer 2

Selection sort is a basic arranging calculation. This arranging calculation is a set up examination based calculation in which the rundown is isolated into two sections, the arranged part at the left end and the unsorted part at the correct end. At first, the arranged part is vacant and the unsorted part is the whole rundown.

The littlest component is chosen from the unsorted cluster and swapped with the furthest left component, and that component turns into a piece of the arranged exhibit. This procedure keeps moving unsorted cluster limit by one component to one side.

This calculation isn't reasonable for substantial informational indexes as its normal and most pessimistic scenario complexities are of Ο(n2), where n is the quantity of things.