answersLogoWhite

0

in selection sorting at first we take first element of the list and start comparing with all the successive element of that list

User Avatar

Wiki User

15y ago

What else can I help you with?

Related Questions

Is quicksort a stable sorting algorithm?

No, quicksort is not a stable sorting algorithm.


What are the different types of algorithm?

insertion,bubble,quick, quick3, merge, shell,heap, selection sorting


Is Quick Sort an in-place sorting algorithm?

Yes, Quick Sort is an in-place sorting algorithm.


Is bubble sort a stable sorting algorithm?

Yes, bubble sort is a stable sorting algorithm.


Is radix sort an in-place sorting algorithm?

Yes, radix sort is an in-place sorting algorithm.


Which sorting algorithm is more efficient for large datasets: quick sort or selection sort?

Quick sort is more efficient for large datasets compared to selection sort.


Which sorting algorithm is more efficient for small datasets: bubble sort or selection sort?

Selection sort is more efficient for small datasets compared to bubble sort.


How many Types of sorting algorithm?

ten types of soting algorithm


In a sorting algorithm the sort order can be changed by changing the operator?

In a sorting algorithm the sort order can be changed by changing the comparison operator.


Which sorting algorithm is considered the best for efficiency and performance?

The quicksort algorithm is considered the best for efficiency and performance among sorting algorithms.


What is the most efficient sorting algorithm available?

The most efficient sorting algorithm available is the Quick Sort algorithm. It has an average time complexity of O(n log n) and is widely used for its speed and efficiency in sorting large datasets.


How does a quicksort algorithm with a visualization feature handle the selection of the pivot element as the first element in the array?

A quicksort algorithm with a visualization feature selects the first element in the array as the pivot element. This means that the algorithm will use the first element as a reference point for sorting the rest of the array.