Introduction
Chapter One: Introduction to Algorithms
Association between Algorithms and Computer Science
Characteristics of an Algorithm
Designing an Algorithm
How to Identify the Best Algorithm
Understanding the Basic Algorithm that Digitally Powers Life
Benefits of Algorithmic Thinking
Pros and Cons
Chapter Two: Types of Algorithms
Backtracking Algorithm
Brute Force Algorithm
Divide and Conquer Algorithm
Dynamic Programming Algorithm
Greedy Algorithm
Randomized Algorithm
Simple Recursive Algorithm
Chapter Three: Describing Algorithms
Chapter Four: Error Handling
Checking for Exceptions
Defining Exceptions
Special Case Patterns
Nulls
Common Error Messages
Dealing with errors
Chapter Five: Analysis of Algorithms
Importance of Analysis
Analysis Methods
Space Complexities
Understanding Recursion
Chapter Six: An Introduction to Writing Programs
Principles of Programming
Objects and Classes
Data Types
Operations
Chapter Seven: Types of Programming Languages
Definition
Types of Programming Languages
Programming Languages
Chapter Eight: Important Programming Techniques
Arrays
Building Big Programs
Bitwise Logic
Boolean Logic
Closures
Concurrency
Decision or Selection
Disk Access
Immutability
Interacting with the Command Line
Interacting with the OS
Lambdas
Loops and Repetitions
Linked Lists
Modular Arithmetic
Pointers
Safe Calls
Scaling and Random Numbers
Strings
Structures
Text Manipulation
Trigonometry
Variables
Chapter Nine: Testing the Program
Laws of TTD
Keeping the Tests Clean
Testing the Abilities of the Code
Clean Tests
Characteristics of Tests
Chapter Ten: Sorting and Searching Algorithms
Searching Algorithms
Sorting Algorithms
Chapter Eleven: Loop Control and Decision Making
Decision Making
Loop Statements
Loop Control Statements
Chapter Twelve: Introduction to Data Structures
The Struct Statement
Accessing Structure Members
Using Structures as Arguments
Using Pointers in Structures
Typedef Keyword
Chapter Thirteen: Comments and Formatting
Comments
Formatting
Chapter Fourteen: Debugging
Conclusion
Resources