theCEED.com - Research your Interests!!
  • MEMBERSHIP PROFILE
  • bar
  • No member information.
  • login_button
  • sign_up_button
no_image

Introduce the sort algorithms

About the ceed

This page is the place to introduce the sort algorithms.
Recommend : 3 I Total List : 3 I 2015-05-18
favorite
Selection sort with source code 2015.05.22 22:44:16
Nickname : 1. unesco Recommend : 1 View : 769 btn_recommend.png declaration

Please enter reasons of report.

declaration

Reference Site : Link Selection Sort


About Selection Sort :

In computer science, selection sort is a sorting algorithm, specifically an in-place comparison sort, It has O(n²) 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.

The algorithm divides the input list into two parts: the sublist of items already sorted, which is built up from left to right at the front (left) of the list, and the sublist of items remaining to be sorted that occupy the rest of the list. Initially, the sorted sublist is empty and the unsorted sublist is the entire input list. The algorithm proceeds by finding the smallest (or largest, depending on sorting order) element in the unsorted sublist, exchanging it with the leftmost unsorted element (putting it in sorted order), in with the leftmost unsorted element (putting it in sorted order), and moving the sublist boundaries one element to the right.


Step-by-step Example:

Here is example of this sort algorithm sorting five elements:


( 64 25 12 22 11 ) // this is the initial, starting state of the array

( 11 25 12 22 64 ) // sorted sublist = {11}

( 11 12 25 22 64 ) // sorted sublist = {11, 12}

( 11 12 22 25 64 ) // sorted sublist = {11, 12, 22}

( 11 12 22 25 64 ) // sorted sublist = {11, 12, 22, 25}

( 11 12 22 25 64 ) // sorted sublist = {11, 12, 22, 25, 64}



list
  • NEXT
  • * NO ARTICLE *
Comments

name

write a comment
TOTAL  1 Comments
name 2015-12-05 10:52:42
[now test this part.]

test now .
sorry now we are test here.
we will fast repair reply page. sorry
edit del