Research Algorithm Analysis with Big-O Summarize what you learn by yourself and analyze one algorithm or simple program (your code) with Big-O. Find at least two or more cases of each Big-O complexity, describe them, and explain why that complexity was determined for the algorithm or operation. It's your own study to analyze SW algorithm or programming logic better. Do not copy and paste from the online materials. A PPT file must include diagrams, images, and/or tables instead of description because all of your audience know what analysis algorithm by Big-O.