Study Notes Generator

# Data Structures Overview

## Arrays
- Contiguous memory allocation
- O(1) access time
- O(n) insertion/deletion time (worst case)

## Linked Lists
- Non-contiguous memory allocation
- O(n) access time
- O(1) insertion/deletion time (with pointer)

## Stacks
- LIFO (Last In First Out)
- Operations: push, pop, peek
- Applications: function calls, undo operations

## Queues
- FIFO (First In First Out)
- Operations: enqueue, dequeue, peek
- Applications: scheduling, BFS algorithm

# Sorting Algorithms

## Bubble Sort
- Time Complexity: O(n²)
- Space Complexity: O(1)
- Stable: Yes

## Merge Sort
- Time Complexity: O(n log n)
- Space Complexity: O(n)
- Stable: Yes

## Quick Sort
- Time Complexity: O(n log n) average, O(n²) worst
- Space Complexity: O(log n)
- Stable: No

## Heap Sort
- Time Complexity: O(n log n)
- Space Complexity: O(1)
- Stable: No