projects / sort-networks.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: b1632a8) | patch
src/sn_random.[ch]: Be more random.
authorFlorian Forster <octo@verplant.org>
Mon, 6 Jun 2011 13:04:58 +0000 (15:04 +0200)
committerFlorian Forster <octo@verplant.org>
Mon, 6 Jun 2011 13:04:58 +0000 (15:04 +0200)
commit0fc40afb5a375236b6d7af3f27b27b21c89c9779
tree59ce68a3b7f4b27f6ad59b9beb8e78044bf23c67tree | snapshot
parentb1632a807fc2166da35bb6b59d60738d4db24627commit | diff
src/sn_random.[ch]: Be more random.

A couple of experiments actually ran into limitations due to the limit
of the PRNG.
src/sn_random.c diff | blob | history
src/sn_random.h diff | blob | history
Evolutionary algorithm to find small sort networks.