Algorithms
Associate of Arts in Liberal Arts · University · Computer Science
This unit introduces the fundamental concepts of algorithms, the step-by-step procedures computers use to solve problems. Students will learn about sorting, searching, and optimization algorithms, and how to analyze their efficiency.
What's included
- Introduction to Algorithms
- Sorting Algorithms (Bubble Sort
- Insertion Sort
- Merge Sort
- Quick Sort
- Heap Sort)
- Searching Algorithms (Linear Search
- Binary Search)
- Algorithm Analysis (Time Complexity
- Big O Notation)
- Divide-and-Conquer Algorithms (Merge Sort
- Quick Sort)
Keywords
- Algorithm Design
- Sorting Algorithms
- Searching Algorithms
- Optimization Algorithms
- Algorithm Analysis
- Algorithm Efficiency
- Big O Notation
- Divide and Conquer
- Greedy Algorithms
- Dynamic Programming