Algorithms Homework – Fall 2000

Then go through the array one element at a time comparing it to the next element; this can be done in ((n) time. If there are any matches, then there are repeated occurrences. 1.2-4 Express the function n3/1000 – 100n2 – 100n + 3 in terms of (-notation. ................
................