CSCC73H3 Study Guide - Quiz Guide: If And Only If, Big O Notation, Discordianism
Document Summary
Csc 373 - algorithm design, analysis, and complexity. Please follow the instructions provided on the course website to submit your assignment. Also, if you use any sources (textbooks, online notes, friends) please cite them for your own safety. You can use those data-structures and algorithms discussed in csc263 (e. g. merge-sort, heaps, etc. ) and in the lectures by stating their name. You do not need to provide any explanation or pseudo-code for their implementation. You can also use their running time without proving them: for example, if you are using the merge-sort in your algorithm you can simply state that merge-sorts running time is o(n log n). State the running time of your algorithm with a brief argument supporting your claim. You must prove that your algorithm nds an optimal solution! Remember when we were kids, we played with marbles?1 we used to also collect them and exchange them for di erent types.
