Topic: Selection Sort
Not finding your answer? Try searching the web for Selection Sort
Answers to Common Questions
What is mean by selection sort?
Selection sort is one of the easiest method of sorting elements of array. In selection sort ,the begaining of the sorting with the comapairing first element of the array with other elements of array by this process smallest value in given a... Read More »
Source: http://wiki.answers.com/Q/What_is_mean_by_selection_sort
What is the operation of a selection sort?
You sort a selected range of cells. Read More »
Source: http://wiki.answers.com/Q/What_is_the_operation_of_a_selection_so...
How to Sort the Printer Driver Selection List in Alphabetical Ord...
If you want to sort the printer driver list in Windows XP, there are several ways you can do so. You can sort the list by type, size or name. If you want to view the list in alphabetical order, you must sort the drivers by name. This is use... Read More »
Source: http://www.ehow.com/how_6869659_sort-alphabetical-order-windows-x...
Featured Content:
Selection Sort
More Common Questions
Answers to Other Common Questions
Advantages: Easy to implement In-place sort (requires no additional storage space) Disadvantages: Doesn't scale well: O(n2)
Read More »
Source: http://wiki.answers.com/Q/What_are_advantages_and_disadvantages_o...
Well, you see.. you start by selecting 5 random cards for each player and then ask each other if they have a certain card that you may want. e.g. "do you have a 6 of spades?" Come back next week to find out what happens next!!
Read More »
Source: http://wiki.answers.com/Q/How_does_the_selection_sort_work
in selection sorting at first we take first element of the list and start comparing with all the successive element of that list
Read More »
Source: http://wiki.answers.com/Q/Who_introduce_selection_sorting_algorit...
( si′lek·shən ′sört ) (computer science) A sorting routine that scans a list of items repeatedly and, on each pass, selects the item with the lowest value and places it in its final position.
Read More »
Source: http://www.answers.com/topic/selection-sort
Because the quick sort can be used for large lists but selection not. selection sort is used to find the minimum element ,but quick choose element called pivot and move all smaller nums before it & larger after it.
Read More »
Source: http://wiki.answers.com/Q/Why_is_quick_sort_better_than_selection...
quick sort has a best case time complexity of O(nlogn) and worst case time complexity of 0(n^2). the best case occurs when the pivot element choosen as the center or close to the center element of the list.the time complexity can be derived...
Read More »
Source: http://wiki.answers.com/Q/How_do_you_select_pivot_in_quick_sort
