Fundamentals of Programming. Unit 7.
  1. Title.
  2. Fibonacci numbers.
  3. Example 1: Sum of integers.
  4. Example 2: Print sum of even numbers.
  5. Example 3: Fill 2D-array with unique random integers.
  6. Example 3: Fill 2D-array with unique random integers. Version 2.
  7. Example 3a: Fill 2D-array with random doubles.
  8. Designated initializers.
  9. Example 4: Bubble sort the array.
  10. Example 4a: Sorting.
  11. Exercise #1.
  12. Exercise #2.
  13. Exercise #3.
  14. Exercise #3 : Scytale encode/decode function.
  15. Exercise #4.
  16. How to use hex with binary.
  17. Useful book.
  18. Example 5a: Max of subvectors sum. Brutal force algorithm.
  19. Example 5b: Max of subvectors sum. Quick algorithm.
  20. Example 5c: Brute force algorithm timing.
  21. Example 5d: Quick algorithm timing.
  22. Example 6: Print binomial expansion series.
  23. Enumeration enum and typedef.
Last Updated 22 Oct, 2018 09:42. <vadimov@i.ua>