Sort Numbers : Sort Search « Collections Data Structure « Java

Sort Numbers

Sort Numbers
 * Copyright (c) 2000 David Flanagan.  All rights reserved.
 * This code is from the book Java Examples in a Nutshell, 2nd Edition.
 * It is provided AS-IS, WITHOUT ANY WARRANTY either expressed or implied.
 * You may study, use, and modify it for any non-commercial purpose.
 * You may distribute it non-commercially as long as you retain this notice.
 * For a commercial use license, or to purchase the book (recommended),
 * visit

 * This class demonstrates how to sort numbers using a simple algorithm
public class SortNumbers {
   * This is a very simple sorting algorithm that is not very efficient when
   * sorting large numbers of things
  public static void sort(double[] nums) {
    // Loop through each element of the array, sorting as we go.
    // Each time through, find the smallest remaining element, and move it
    // to the first unsorted position in the array.
    for (int i = 0; i < nums.length; i++) {
      int min = i; // holds the index of the smallest element
      // find the smallest one between i and the end of the array
      for (int j = i; j < nums.length; j++) {
        if (nums[j] < nums[min])
          min = j;
      // Now swap the smallest one with element i.
      // This leaves all elements between 0 and i sorted.
      double tmp;
      tmp = nums[i];
      nums[i] = nums[min];
      nums[min] = tmp;

  /** This is a simple test program for the algorithm above */
  public static void main(String[] args) {
    double[] nums = new double[10]; // Create an array to hold numbers
    for (int i = 0; i < nums.length; i++)
      // Generate random numbers
      nums[i] = Math.random() * 100;
    sort(nums); // Sort them
    for (int i = 0; i < nums.length; i++)
      // Print them out


Related examples in the same category

1.Linear search
2.Animation for quick sort
3.Quick Sort Implementation with median-of-three partitioning and cutoff for small arrays
4.Simple Sort DemoSimple Sort Demo
5.A simple applet class to demonstrate a sort algorithm
6.Sorting an array of StringsSorting an array of Strings
7.Simple version of quick sortSimple version of quick sort
8.Combine Quick Sort Insertion SortCombine Quick Sort Insertion Sort
9.Quick sort with median-of-three partitioningQuick sort with median-of-three partitioning
10.Fast Quick Sort
11.Selection sortSelection sort
12.Insert Sort for objectsInsert Sort for objects
13.Insert sortInsert sort
14.Bubble sortBubble sort
15.Merge sortMerge sort
16.Fast Merge Sort
17.Binary SearchBinary Search
18.Shell sortShell sort
19.Recursive Binary Search Implementation in Java
20.Topological sortingTopological sorting
21.Heap sortHeap sort
22.A quick sort demonstration algorithmA quick sort demonstration algorithm
23.Performing Binary Search on Java byte Array Example
24.Performing Binary Search on Java char Array Example
25.Performing Binary Search on Java double Array Example
26.Performing Binary Search on Java float Array Example
27.Performing Binary Search on Java int Array Example
28.Performing Binary Search on Java long Array Example
29.Performing Binary Search on Java short Array
30.Sort items of an array
31.Sort an array of objects
32.Sort a String array
33.Sort string array with Collator
34.Binary search routines
35.FastQ Sorts the [l,r] partition (inclusive) of the specfied array of Rows, using the comparator.FastQ Sorts the [l,r] partition (inclusive) of the specfied array of Rows, using the comparator.
36.A binary search implementation.
37.Handles QuickSort and all of its methods.
38.Implements QuickSort three different ways
39.A quick sort algorithm to sort Vectors or arrays. Provides sort and binary search capabilities.A quick sort algorithm to sort Vectors or arrays. Provides sort and binary search capabilities.
40.Returns an array of indices indicating the order the data should be sorted in.