Demonstrate the Bubble sort : Sort « Collections Data Structure « C# / C Sharp

1. C# / C Sharp
2. Collections Data Structure
3. Sort

Demonstrate the Bubble sort

  
/*
C# A Beginner's Guide
By Schildt

Publisher: Osborne McGraw-Hill
ISBN: 0072133295
*/
/* 
   Project 5-1 
   Demonstrate the Bubble sort. 
*/ 
using System; 
 
public class BubbleSort {  
  public static void Main() {  
    int[] nums = { 99, -10, 100123, 18, -978, 
                   5623, 463, -9, 287, 49 }; 
    int a, b, t;  
    int size;  
  
    size = 10; // number of elements to sort  
  
    // display original array  
    Console.Write("Original array is:"); 
    for(int i=0; i < size; i++) 
      Console.Write(" " + nums[i]);  
    Console.WriteLine();  
  
    // This is the bubble sort.  
    for(a=1; a < size; a++)  
      for(b=size-1; b >= a; b--) {  
        if(nums[b-1] > nums[b]) { // if out of order  
          // exchange elements   
          t = nums[b-1];  
          nums[b-1] = nums[b];  
          nums[b] = t;  
        }  
      }  
  
    // display sorted array  
    Console.Write("Sorted array is:");  
    for(int i=0; i < size; i++) 
      Console.Write(" " + nums[i]);  
    Console.WriteLine(); 
  } 
}



           
         
    
  

Related examples in the same category

1.	Implements the recursive merge sort algorithm to sort an array
2.	Sorts an array of data using the insertion sort algorithm
3.	Bubble sort
4.	A simple version of the Quicksort
5.	Insert Sort
6.	A simple stable sorting routine - far from being efficient, only for small collections.
7.	Quick Sort