CSE 15 Lecture Notes - Lecture 14: Compile Time, Quicksort, Type Safety
Document Summary
How do you analyze a function: if you have loops, see how many times it loops, (ex 6 in quiz 4 review) If you declare a pointer variable, is it stack or heap? stack. Ex: void foo(){ int *p; on stack without malloc p = malloc(--); on heap int a[10]; stack (x = *a means first element of a) Is everything a pointer in c? reference semantics. When you refer to something on the right side, you get its value, when you say something is equal to a variable, you get the address. Asymptotic cases? (is there a formula for how we count the number of operations or is it just logic?) If there are not loops/recursion, then it only has a fixed number of steps to go through. If loop goes around some function of n, multiply it by a constant, and keep going until you go through all the loops. Ex: 400 hundred papers, you"re looking for one.
