Mathematics Project___Final.docx - 1 Suppose you are given a set of n numbers x1 x2 xn and are asked to determine whether this set contains any

Mathematics Project___Final.docx - 1 Suppose you are given...

This preview shows page 1 - 3 out of 10 pages.

1.Suppose you are given a set of n numbers x1, x2, ..., xn and are asked to determine whether this set contains any duplicates. (232(a) Suggest an algorithm and find an order-of-magnitude expression for its time complexity. (b) Examine if the implementation of the algorithm on a Turing machine affects your conclusions. ) Solution: 1
Image of page 1
2.Repeat Exercise 1, this time determining if the set contains any triplicates. Is the algorithm as efficient as possible? (232 )
Image of page 2
Image of page 3

You've reached the end of your free preview.

Want to read all 10 pages?

  • Spring '15
  • Dr Mahmoud Khalil
  • Computational complexity theory, Halting problem, Non-deterministic Turing machine, Probabilistic Turing machine

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture