The performance of the selection sort algorithm

Selection sort's worst-case performance is O(N2). Note that its worst performance is similar to bubble sort and it should not be used for sorting larger datasets. Still, selection sort is a better designed algorithm than bubble sort and its average performance is better than bubble sort due to the reduction in the number of exchanges. 

..................Content has been hidden....................

You can't read the all page of ebook, please click here login for view all page.
Reset
3.144.189.177