Scribd
Upload
7 views2 pages

Algorithms Notes

Uploaded by

hassanmi2005
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
7 views2 pages

Algorithms Notes

Uploaded by

hassanmi2005
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Algorithms & Data Structures Report

Abstract
This document explores algorithms and data structures, focusing on complexity analysis,
sorting, searching, and graph algorithms. It includes pseudocode and examples for practical
learning.

Introduction
Algorithms are step-by-step instructions for solving problems.

Efficiency is analyzed using time and space complexity.

Complexity
Big O describes upper bound (worst case).

Big Ω describes lower bound (best case).

Big Θ describes average case.

Sorting Algorithms
Merge Sort: Divide and conquer, O(n log n).

Quick Sort: Fast average, but O(n^2) worst case.

Heap Sort: Efficient with priority queues.

Graph Algorithms
BFS explores neighbors level by level.

DFS explores deeply before backtracking.

Dijkstra finds shortest paths with non-negative weights.

Kruskal and Prim find minimum spanning trees.

References
Cormen, T. (2022). Introduction to Algorithms.

Sedgewick, R. (2021). Algorithms.


MIT OpenCourseWare (Algorithm Lectures).

You might also like