Why do we analyze data structures and algorithms?
What do we keep track of?
How do we do the analysis?
Given some code blocks, be able to calculate the number of required clock cycles (and explain how you came up with that answer):
Explain BigO notation.
Explain how the growth in N affects our analysis.
Discuss two sorting algorithms and compare them (compare and contrast) – include BigO; comparisons and swaps.
Label a BigO Complexity Chart
The answers should be “Short and clear” not so complicated. If you need to use some codes don’t use long codes please.