We implement several data-structures and algorithms to solve programming problems which we shall use in the later chapters.We begin with writing integer programs to search for counterexamples of the Collatz conjecture. We analyze Barker sequences, calculate their merit factor.We implement factorial, gcd functions while discussing the properties of tail-recursive functions and how to implement them on the SPU which has limited stack space. We then implement searching and sorting data-structures and algorithms. Finally some advanced data-structures such as hash, perfect-hash, union-find, and min-heap and max-heap are implemented.
KeywordsHash Function Table Lookup Sorting Algorithm Table Size Greatest Common Divisor
Unable to display preview. Download preview PDF.