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

Home
C# / C Sharp
1.2D Graphics
2.Class Interface
3.Collections Data Structure
4.Components
5.Data Types
6.Database ADO.net
7.Date Time
8.Design Patterns
9.Development Class
10.Event
11.File Stream
12.Generics
13.GUI Windows Form
14.Internationalization I18N
15.Language Basics
16.LINQ
17.Network
18.Office
19.Reflection
20.Regular Expressions
21.Security
22.Services Event
23.Thread
24.Web Services
25.Windows
26.Windows Presentation Foundation
27.XML
28.XML LINQ
C# / C Sharp » Collections Data Structure » Sort 




Bubble sort
Bubble sort
  

using System;


  delegate bool Comparator(object lhs, object rhs);

  class MainEntryPoint {
    static void Main() {
      Employee [] employees = {
              new Employee("A"20000),
              new Employee("B"10000),
              new Employee("C"25000),
              new Employee("D"99999),
              new Employee("E"23000),
              new Employee("F"50000)};
              
      BubbleSorter.Sort(employees, new Comparator(Employee.IsGreater));

      for (int i=; i<employees.Length ; i++){
        Console.WriteLine(employees[i].ToString());
      }  
    }
  }

  class Employee {
    private string name;
    private decimal salary;

    public Employee(string name, decimal salary)
    {
      this.name = name;
      this.salary = salary;
    }

    public override string ToString()
    {
      return string.Format(name + ", {0:C}", salary);
    }

    public static bool IsGreater(object a, object b)
    {
      Employee empA = (Employeea;
      Employee empB = (Employeeb;
      return (empA.salary > empB.salarytrue false;
    }
  }

  class BubbleSorter
  {
    static public void Sort(object [] sortArray, Comparator gtMethod) {
      for (int i=; i<sortArray.Length ; i++) {
        for (int j=i+; j<sortArray.Length ; j++) {
          if (gtMethod(sortArray[j], sortArray[i])) {
            object temp = sortArray[i];
            sortArray[i= sortArray[j];
            sortArray[j= temp;
          }
        }
      }
    }
  }

           
         
    
  














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.A simple version of the QuicksortA simple version of the Quicksort
4.Demonstrate the Bubble sortDemonstrate the Bubble sort
5.Insert Sort
6.A simple stable sorting routine - far from being efficient, only for small collections.
7.Quick Sort
java2s.com  | Contact Us | Privacy Policy
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.