1 / 5

Chapter 3: Iteration

Chapter 3: Iteration. Fibonacci 0 1 1 2 3 5 8 13. unsigned fib(unsigned n) { int first = 0, second = 1; while (n--) { unsigned tmp = first+second; first = second; second = tmp; } return first; }. CS Education: The Future.

tcotton
Télécharger la présentation

Chapter 3: Iteration

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Chapter 3: Iteration Fibonacci 0 1 1 2 3 5 8 13 unsigned fib(unsigned n) { int first = 0, second = 1; while (n--) { unsigned tmp = first+second; first = second; second = tmp; } return first; } Personal Robots in Education

  2. CS Education: The Future “The nature of these jobs is not closing the door and coding. “The great missing skill is somebody who’s good at understanding engineering and then bridges that to working with customers and marketing...” Personal Robots in Education

  3. How? Personal Robots in Education

  4. Announcing • The Institute for Personal Robots in Education Personal Robots in Education

  5. Making it Real Personal Robots in Education

More Related