Selection sort : Sort Search « Collections Data Structure « Java

Java
1. 2D Graphics GUI
2. 3D
3. Advanced Graphics
4. Ant
5. Apache Common
6. Chart
7. Collections Data Structure
8. Database SQL JDBC
9. Design Pattern
10. Development Class
11. Email
12. Event
13. File Input Output
14. Game
15. Hibernate
16. J2EE
17. J2ME
18. JDK 6
19. JSP
20. JSTL
21. Language Basics
22. Network Protocol
23. PDF RTF
24. Regular Expressions
25. Security
26. Servlets
27. Spring
28. Swing Components
29. Swing JFC
30. SWT JFace Eclipse
31. Threads
32. Tiny Application
33. Velocity
34. Web Services SOA
35. XML
Microsoft Office Word 2007 Tutorial
Java Tutorial
Java Source Code / Java Documentation
Java Open Source
Jar File Download
Java Articles
Java Products
Java by API
C# / C Sharp
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
Java » Collections Data Structure » Sort SearchScreenshots 
Selection sort
Selection sort

public class SelectionSort {
  private long[] a;

  private int nElems;

  public SelectionSort(int max) {
    a = new long[max];
    nElems = 0;
  }

  public void insert(long value) {
    a[nElems= value;
    nElems++;
  }

  public void display() {
    for (int j = 0; j < nElems; j++)
      System.out.print(a[j" ");
    System.out.println("");
  }

  public void selectionSort() {
    int out, in, min;

    for (out = 0; out < nElems - 1; out++// outer loop
    {
      min = out; // minimum
      for (in = out + 1; in < nElems; in++)
        // inner loop
        if (a[in< a[min]) // if min greater,
          min = in; // a new min
      swap(out, min)// swap them
    }
  }

  private void swap(int one, int two) {
    long temp = a[one];
    a[one= a[two];
    a[two= temp;
  }

  public static void main(String[] args) {
    int maxSize = 100;
    SelectionSort arr; // reference to array
    arr = new SelectionSort(maxSize)// create the array

    arr.insert(17)// insert 10 items
    arr.insert(29);
    arr.insert(34);
    arr.insert(45);
    arr.insert(52);
    arr.insert(68);
    arr.insert(71);
    arr.insert(80);
    arr.insert(96);
    arr.insert(33);

    arr.display();

    arr.selectionSort();

    arr.display();
  }

}

           
       
Related examples in the same category
1. Simple Sort DemoSimple Sort Demo
2. A simple applet class to demonstrate a sort algorithm
3. Sorting an array of StringsSorting an array of Strings
4. Simple version of quick sortSimple version of quick sort
5. Combine Quick Sort Insertion SortCombine Quick Sort Insertion Sort
6. Quick sort with median-of-three partitioningQuick sort with median-of-three partitioning
7. Insert Sort for objectsInsert Sort for objects
8. Insert sortInsert sort
9. Bubble sortBubble sort
10. Merge sortMerge sort
11. Binary SearchBinary Search
12. Shell sortShell sort
13. Topological sortingTopological sorting
14. Heap sortHeap sort
15. Sort NumbersSort Numbers
16. A quick sort demonstration algorithmA quick sort demonstration algorithm
17. Customized Sort Test
w__w__w__.j_av___a2s_.__c___om__ | Contact Us
Copyright 2003 - 08 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.