Choice of Algorithms and Algorithm Dynamics: Part I

Menu

1. Choice of Algorithms and Algorithm Dynamics: Part I
2. What is an algorithm?
3. Characteristics of an Algorithm
4. Why Study Algorithms?
5. Recasting a Problem
6. Two Key Considerations
7. Computational Problem
8. Designing Algorithms
9. Designing Algorithms
10. Taking Problem Apart
11. Flow Chart
12. Designing an Algorithm: Pseudocode
13. Statement Structures
14. Statement Structures
15. Statement Structures
16. Statement Structures
17. Basic Algorithmic Technique
18. Recursion
19. Shifting from Algorithm->Program
20. Algorithms vs. Programs
21. Programs
22. Two Key Considerations
23. Algorithmic Performance
24. Data Structures
25. Choice of Data Structure
26. How do we evaluate an algorithm?
27. How do we evaluate an algorithm?
28. How do we evaluate an algorithm?
29. Algorithm Analysis
30. Running Time
31. Problem Complexity
32. Solved, Unsolved and Hard Problems

FINISH

SUBMIT

NEXT

PREV