Floyd-wharshall algoritm for the shortest path problem. I wrote this in C. It s easy to compile and work in all *nix like systems.-Floyd-wharshall algoritm for the shortest path problem. I wrote this in C. It s easy to compile and work in all*nix lik

A order algoritm comparison by the C time(). Comparison beetwen : insort,selection sort,mergesort,and quick sort. Read the source, and the usage after compiling . Enjoy it!-A order algoritm comparison by the C time(). Comparison beetwen : in