What's the worst that could happen?
While we've still been discussing proving various proofs, we've brought in a little programming and a couple functions to give us a new set of problems.
The functions we've been looking at currently are basically just sorting functions, say you have a list of random numbers and you wish to sort them from least to greatest, find the single biggest number, or find which two adjacent numbers make the greatest sum. You will always have some case where your program/function takes the absolute longest time to complete. We've been concentrating on how to calculate how many steps a function can take, and creating formulas based on the length of the list that tell us the longest possible time/most possible steps the function can take before completing.
Damn well confusing at first, but since we're so lazy we can just overestimate (maybe extremely), it seems like a very simple concept with practice.
No comments:
Post a Comment