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
Bubble Sort with source code 2015.05.22 13:29:01
Nickname : 1. unesco Recommend : 1 View : 773 btn_recommend.png declaration

Please enter reasons of report.

declaration

Reference Site : Link Bubble Sort



About Bubble Sort :

Bubble Sort, sometimes referred to as sinking sort, is a simple sorting algorithmthat repeatedly steps through the list to be sorted, compares each pair of adjacent items and swapsthem if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted. The algorithm, which is acomparison sort, is named for the way smaller elements "bubble" to the top of the list. Although the algorithm is simple, it is too slow and impractical for most problems even when compared toinsertion sort. It can be practical if the input is usually in sort order but may occasionally have some out-of-order elements nearly in position.



Step-by-step example :

Let us take the array of numbers "5 1 4 2 8", and sort the array from lowest number to greatest number using bubble sort. In each step, elements written in bold(colored) are being compared. Three passes will be required.


First Pass:

( 5 1 4 2 8 ) -> ( 1 5 4 2 8 ), Here, algorithm compares the first two elements, and swaps since 5 > 1.

( 1 5 4 2 8 ) -> ( 1 4 5 2 8 ), Swap since 5 > 4

( 1 4 5 2 8 ) -> ( 1 4 2 5 8 ), Swap since 5 > 2

( 1 4 2 5 8 ) -> ( 1 4 2 5 8 ), Now, since these elements are already in order ( 8 > 5), algorithm does not swap them.


Second Pass:

( 1 4 2 5 8 ) -> ( 1 4 2 5 8 )

( 1 4 2 5 8 ) -> ( 1 2 4 5 8 ), Swap since 4 > 2

( 1 2 4 5 8 ) -> ( 1 2 4 5 8 )

( 1 2 4 5 8 ) -> ( 1 2 4 5 8 )

Now, the array is already sorted, but the algorithm does not know if it is completed. The algorithm needs one whole pass without any swap to know it is sorted.


Third Pass:

( 1 2 4 5 8 ) -> ( 1 2 4 5 8 )

( 1 2 4 5 8 ) -> ( 1 2 4 5 8 )

( 1 2 4 5 8 ) -> ( 1 2 4 5 8 )

( 1 2 4 5 8 ) -> ( 1 2 4 5 8 )



Source using C:

Basic Source::


for(i = MINIMUM; i < MAXIMUM; i++) {                          
     for(j = MINIMUM; j < MAXIMUM-1; j++) {                 
          if(array[j] > array[j+1]) {                                         
               temp = array[j];                                                       
               array[j] = array[j+1];                                            
               array[j+1] = temp;                                                  
          }                                                                                         
     }                                                                                              
}                                                                                                   


Time lap by 100,000EA::



result 47.93 (second)


Optimizing Sources::


for(i = MINIMUM; i < MAXIMUM; i++) {                       
     for(j = MINIMUM; j < MAXIMUM-goal; j++) {        
          if(array[j] > array[j+1]) {                                     
               temp = array[j];                                                    
               array[j] = array[j+1];                                        
               array[j+1] = temp;                                              
          }                                                                                    
     }                                                                                          
     goal++;                                                                             
}                                                                                              


Time lap By 100,000EA::



result 32.03 (second)
















list
Comments

name

write a comment
TOTAL  1 Comments
name 2015-12-05 00:20:09
[now test this part.]

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