<- previous index next ->
Permutations, Combinations, Heapsort
Some various utility routines that may be used for applications
or generating tests.
Generating all permutations of a vector
permute.h
permute.c
test_permute.c
test_permute_c.out
permute.ads
permute.adb
test_permute.adb
test_permute_ada.out
permute.java
test_permute.java
test_permute_java.out
Generating Combinations of N things taken M at a time
combinations.h
combinations.c
test_combinations.c
test_combinations_c.out
combinations.ads
combinations.adb
test_combinations.adb
test_combinations_ada.out
combinations.java
test_combinations.java
test_combinations_java.out
Heap Sort a vector, get sort indices, multi dimensions
heapsort.h
heapsort.c
test_heapsort.c int, double, char
test_heapsort_c.out
test2_heapsort.c on struct
test2_heapsort_c.out
heap_sort_2.ads
heap_sort_2.adb
test_heap_sort_2.adb
test_heap_sort_2_ada.out
heapsort.java
test_heapsort.java
test_heapsort_java.out
get_close.java
test_get_close.java
test_get_close_java.out
A version of the traveling salesman program, tsp.
Once in a while, the heuristic solution O(n^2) comes out
the same as the NP Complete solution.
Every run gets different random numbers.
tsp.c
tsp.out
<- previous index next ->