merge.php is implementation of the merge-sort algorithm for counting inversions in an integer array. Inversion is case where the bigger number goes before the smaller in the array. The brute-force counting of inversions is this:

For (int i=0; i< array_length; i++) { For (int j=i+1; j < array_length; j++) { if (array[i]>array[j]) inversions = inversions +1; } }

quicksort.php is implementation of the quicksort algorithm for sorting integer arrays. It is tested on files 10.txt, 100.txt, 1000.txt and QuickSort.txt for number of comparisons.

mincut.php is implementation of min-cut algorithm (finds minimum cut of a graph). To find min cut, one needs to run script nlog(n) times where n is the number of nodes in graph.