This is an overview of projects conducted by Dedinsky IR at IBS (Intellectual school), Moscow.
An overview and efficiency comparison of 8 array sorting algorithms:
- Selection
- Bubble/Shaker
- Simple/Binary Insertion
- Quick
- Heap
- Merge with different array filling patterns (increasing/decreasing/random/random mod 5).
The key parametes for the actual comparison were of integer comparisons (Ncomps) and swaps (Nswaps) performed by current algorithm.
Interface powered by TXLib.
A simple maze-type game with primitive AI of enemies, TXLib-powered graphics and a recognizable design :)