What is an algorithm?

Question 1

What is an algorithm?

Answer 1

Set of instructions to solve a problem

Question 2

Why do we care about time/space complexity?

Answer 2

B/c its how we compare how one algorithm is better than another.

Question 3

What is time complexity ?

Answer 3

How long does the function take compared to the size of its input?

Question 4

Without ___ we can’t know the best case. So we must assume worst case.

Answer 4

Context!

Question 5

What’s an example of logrithmic time? (log n)

Answer 5

Binary search tree. Cuts in half every time!

Question 6

What’s an example of N Complexity?

Answer 6

Just regular iteration through letters of a string.

Question 7

What is space complexity?

Answer 7

How much space in memory youre taking up relative to the size of your input

Question 8

String dups checking - two sum style

Answer 8

Space Complexity -> O of 1 (throwing the letter out if it doesn’t match)
Time complexity -> N * (n-1)

Question 9

String dups checking - hash map style

Answer 9

Space Complexity O of N (keeping the letter in the hash to check. NOT throwing it out as you go.)
Time complexity -> O of N.

Question 10

If you have 64 objects, how many ways can you arrange them?

Answer 10

64! (64 factorial)