CSE 250 Lecture Notes - Lecture 9: Entry Point, Subsequence, Product Rule

• School: University at Buffalo
• Department: Computer Science & Engineering
• Course: CSE 250
• Professor: Andrew Hughes

Document Summary

We can access a subsequence: set begin and end to other locations int a[5]; int* begin = a+1; int* end = a+3, this covers the two element sequence a[1], a[2] A[(cid:1004)] | a[(cid:1005)] a[(cid:1006)] | a[(cid:1007)] a[(cid:1008)] . Always ensure that end comes after (or is the same as) begin. Bucket sort (idea): read file character by character (assuming all lowercase and no spaces, convert char code to values in range 0-25, inclusive (for a-z) Note that i(cid:374)t (cid:894)(cid:858)a(cid:859)(cid:895) == 97: count all occurrences of each character, print out a copy of each occurrence of a character. We (cid:272)a(cid:374) also (cid:862)retur(cid:374)(cid:863) data (cid:271)y updati(cid:374)g a (cid:374)o(cid:374)-const reference. A combination of these arguments allow for any number of return values. We want to be able to compare algorithms/data structures relative to time/space complexity. How can we compare functions with one another: what are the sizes of our inputs, how long does it take to run our program.