• Description
• Lessons
  1. Goals of the course; what is computation; introduction to data types, operators, and variables
  2. Operators and operands; statements; branching, conditionals, and iteration
  3. Class[2]: "Common code patterns: iterative programs"
  4. Decomposition and abstraction through functions; introduction to recursion
  5. Floating point numbers, successive refinement, finding roots
  6. Bisection methods, Newton/Raphson, introduction to lists
  7. Lists and mutability, dictionaries, pseudocode, introduction to efficiency
  8. Complexity; log, linear, quadratic, exponential algorithms
  9. Binary search, bubble and selection sorts
  10. Divide and conquer methods, merge sort, exceptions
  11. Testing and debugging
  12. More about debugging, knapsack problem, introduction to dynamic programming
  13. Dynamic programming: overlapping subproblems, optimal substructure
• Members
• Forum

Lesson 9: Binary search, bubble and selection sorts

Assignments