djitz

package com.djitz.sort;

import java.util.ArrayList;
import java.util.List;
import java.util.Random;

/**
 * Quick sort algorithm (simple)
 * based on pseudo code on Wikipedia "Quick Sort" aricle
 * 

djitz

import java.util.Arrays;
import java.util.Random;

/**
 * Merge sort algorithm (Top down)
 * based on pseudocode at Wikipedia "Merge sort" article
 * @see <a href="http://en.wikipedia.org/wiki/Merge_sort"/> 
 * @author djitz
 *
 */

djitz

//Array
A = {1...n}

//Sort algorithm
for i = 2 to n
   j = i
   while j > 1
      if A[j] < A[j - 1]
         swap A[j] and A[j - 1]
      j = j - 1

djitz

import java.util.Arrays;
import java.util.Random;

/**
 * Insertion Sort Algorithm.
 * @author djitz
 *
 */
public class InsertionSort {