Logo Data Structures and Algorithms with Object-Oriented Design Patterns in C++
next up previous contents index

Projects

  1. Write a C++ function that takes a single integer argument n and has a worst-case running time of O(n).
  2. Write a C++ function that takes a single integer argument n and has a worst-case running time of tex2html_wrap_inline59179.
  3. Write a C++ function that takes two integer arguments n and k and has a worst-case running time of tex2html_wrap_inline60893.
  4. Write a C++ function that takes a single integer argument n and has a worst-case running time of tex2html_wrap_inline59891.
  5. Write a C++ function that takes a single integer argument n and has a worst-case running time of tex2html_wrap_inline59897.
  6. Write a C++ function that takes a single integer argument n and has a worst-case running time of tex2html_wrap_inline59907.
  7. The generalized Fibonacci numbers of order tex2html_wrap_inline60907 are given by

    equation2395

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

next up previous contents index

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