Algorithm Analysis

Question 1

What is Big-O notation? (basic definition)

Answer 1

It is the worst case running time of an algorithm

Question 2

What is an algorithm

Answer 2

it is like a recipe to transform ingredients(input) to a pie(output).

it is a sequence(step by step) of computational steps that allows you to transform input into output

Question 3

program vs algorithm

Answer 3

without an algorithm, there can be no program

An algorithm can be implemented in any programming language

Question 4

How do we analyze an algorithm

Answer 4

analyzing a program’s running time without coding it.

the amount of resources and time an algorithm uses