Data Structures and Algorithms with Object-Oriented Design Patterns in Python
next up previous index

Projects

  1. Write a Python method that takes a single integer argument n and has a worst-case running time of O(n).
  2. Write a Python method that takes a single integer argument n and has a worst-case running time of tex2html_wrap_inline58629.
  3. Write a Python method that takes two integer arguments n and k and has a worst-case running time of tex2html_wrap_inline60361.
  4. Write a Python method that takes a single integer argument n and has a worst-case running time of tex2html_wrap_inline59347.
  5. Write a Python method that takes a single integer argument n and has a worst-case running time of tex2html_wrap_inline59353.
  6. Write a Python method that takes a single integer argument n and has a worst-case running time of tex2html_wrap_inline59363.
  7. The generalized Fibonacci numbers of order tex2html_wrap_inline60375 are given by

    equation2483

    Write both recursive and non-recursive methods that compute tex2html_wrap_inline60377. Measure the running times of your algorithms for various values of k and n.

next up previous index

Bruno Copyright © 2003, 2004 by Bruno R. Preiss, P.Eng. All rights reserved.