Zaleski |
| Introduction |
Code SamplesHere are a few samples of code written by myself in a few languages. All of which you may use under GPL if proper credit is given to me the author. Rand Evolve (tgz) - This is some work I did for my bachelor's thesis. It evolves a simple pseudorandom number generator that passes the X^2 test and some Uniqueness tests. There's still some room for some work so I versioned it at 0.6, but it went fairl well. It runs with the Open Beagle evolutionary framework. It may have problems compiling if the sources aren't installed into /usr/local, but I haven't tested it. Quick Sort Pivot in Assembly (zip) - This is the most interesting thing I did in my Assembly class. I wanted to learn quicksort, so I did, and I needed to demonstrate linkage between C++ and Assembly. This code ran under Visual C++ 6.0. It compiles the assembly below as an object and links it against the C++ file which does the recursion. I could have done the code in either all assembly or C++, but the linkage was what I needed to demonstrate and quicksort was just because we didn't do it any other time. Actual Pivot Code (ASM) - This is the MASM code that does the pivot for quicksort. The recursion is done in the C++ file from the zip above. Binary Search Tree (zip) - This is some JAVA code which implements a binary search tree. Rather easy to write, I had to do it for my datastructures class. JAVA is a nice language, I would like it allot more if the implementation was better. I haven't tried gcj, but I'm curious how it would do. BST Class (java) - Here's the main JAVA file incase you just want to look at it. The above zip has what you would need to test it. Shift Add Multiplier (ASM) - Here's a small assembly assignment that just does the shift add algorithm for multiplication. It relies on Kip Irvines libraries from his assembly book and should compile with MASM. A pretty simple piece of code. |