package sort.hoar;

public class Proc {
	
	public void sort(int[] a, int l, int r) {
		int x = a[(l + r) / 2 - 1];
		int i = l, j = r;
		while (i <= j) {
			while (a[i - 1] < x) i++;
			while (a[j - 1] > x) j--;
			if (i <= j) {
				int w = a[i - 1]; a[i - 1] = a[j - 1]; a[j - 1] = w; i++; j--;
			}
		}
		if (l < j) sort(a, l, j);
		if (i < r) sort(a, i, r);
	}
	
	public static void main(String[] args) {
		System.out.println("a");
		int[] a = new int[] { 44, 55, 12, 42, 94, 6, 18, 67 };
		int k = 0;
		while (k < a.length) {
			System.out.print(" " + a[k]);
			k++;
		}
		new Proc().sort(a, 1, a.length);
		System.out.println("");
		k = 0;
		while (k < a.length) {
			System.out.print(" " + a[k]);
			k++;
		}
	}

}

let l = [ 44; 55; 12; 42; 94; 6; 18; 67 ]
l |> List.iter (fun x -> printf " %i" x);;  

let rec quicksort = function
| [] -> []
| h::t -> quicksort ([ for x in t do if x<=h then yield x]) 
        @ [h] @ quicksort ([ for x in t do if x>h then yield x]);;
  
printfn "";;
quicksort l |> List.iter (fun x -> printf " %i" x);;  

package sort.hoar;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.stream.Collectors;

public class Func {

    public static void main(String[] args) {
    	
    	List<Integer> l = new ArrayList<Integer>(Arrays.asList( 44, 55, 12, 42, 94, 6, 18, 67 ));
       	l.forEach(x -> System.out.print(" " + x));
       	System.out.println();
       	sort(l).forEach(x -> System.out.print(" " + x));
    }
   
	static List<Integer> sort(List<Integer> l) {
		
		List<Integer> sl = new ArrayList<Integer>();
		
		if(!l.isEmpty()) {
			int h = l.get(0);

			sl = sort(l.stream().filter(x -> x < h).collect(Collectors.toList()));
	    	        sl.add(h); 
	    	        sl.addAll(sort(l.stream().filter(x -> x > h).collect(Collectors.toList())));
	
		}
    	return sl;
	}
	
}