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

C# / C Sharp
1. 2D Graphics
2. Class Interface
3. Collections Data Structure
4. Components
5. Data Types
6. Database ADO.net
7. Design Patterns
8. Development Class
9. Event
10. File Stream
11. Generics
12. GUI Windows Form
13. Language Basics
14. LINQ
15. Network
16. Office
17. Reflection
18. Regular Expressions
19. Security
20. Services Event
21. Thread
22. Web Services
23. Windows
24. XML
25. XML LINQ
Java
Java Tutorial
Java Source Code / Java Documentation
Java Open Source
Jar File Download
Java Articles
Java Products
Java by API
C# / CSharp Tutorial
ASP.Net
JavaScript DHTML
JavaScript Tutorial
JavaScript Reference
HTML / CSS
HTML CSS Reference
C / ANSI-C
C Tutorial
C++
C++ Tutorial
PHP
Python
SQL Server / T-SQL
Oracle PL / SQL
Oracle PL/SQL Tutorial
PostgreSQL
SQL / MySQL
MySQL Tutorial
VB.Net
VB.Net Tutorial
Flash / Flex / ActionScript
VBA / Excel / Access / Word
Microsoft Office PowerPoint 2007 Tutorial
Microsoft Office Excel 2007 Tutorial
Microsoft Office Word 2007 Tutorial
C# / C Sharp » Collections Data Structure » SortScreenshots 
Demonstrate the Bubble 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, -1010012318, -978
                   5623463, -928749 }
    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 arrayImplements the recursive merge sort algorithm to sort an array
2. Sorts an array of data using the insertion sort algorithmSorts an array of data using the insertion sort algorithm
3. Bubble sort
4. A simple version of the QuicksortA simple version of the Quicksort
w__w___w.___j__a__v__a_2__s___.__co_m_ | Contact Us
Copyright 2003 - 08 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.