Data Structures and Algorithms

VTherefore it is absolutely key that you think about the run time complexity andspace requirements of your selected approach. In this book we only explain thetheoretical implications to consider, but this is for a good reason: compilers arevery different in how they work. One C++ compiler may have some amazingoptimisation phases specifically targeted at recursion, another may not, for example.Of course this is just an example but you would be surprised by howmany subtle differences there are between compilers. These differences whichmay make a fast algorithm slow, and vice versa. We could also factor in thesame concerns about languages that target virtual machines, leaving all theactual various implementation issues to you given that you will know your language’scompiler much better than us...well in most cases. This has resulted ina more concise book that focuses on what we think are the key issues.One final note: never take the words of others as gospel; verify all that canbe feasibly verified and make up your own mind.We hope you enjoy reading this book as much as we have enjoyed writing it.Granville BarnettLuca Del Tongo