this gives the following resultsas we can seethis gives us pretty much what we expect it should be remembered that this represents both the performance of the algorithm itself as well as the behavior of underlying software and hardware platformsas indicated by both the variability in the measured runtime and the relative magnitude of the runtime obviously faster processor will result in faster runtimesand also performance will be affected by other running processesmemory constraintsclock speedand so on summary in this we have taken general overview of algorithm design importantlywe saw platform independent way to measure an algorithm' performance we looked at some different approaches to algorithmic problems we looked at way to recursively multiply large numbers and also recursive approach for merge sort we saw how to use backtracking for exhaustive search and generating strings we also introduced the idea of benchmarking and simple platform-dependent way to measure runtime in the following we will revisit many of these ideas with reference to specific data structures in the next we will discuss linked lists and other pointer structures