Simple Computer Science Fundamentals

Overview

This is a personal project/playground to elaborate some of fundamentals Computer Science such as Algorithms and Data Structure

It usually covers some basic implementations of algorithms or data structure, together with detailed comments to explain and elaborate.

Please note that this README.md is used for brief introduction, it won't cover complete details!

Algorithms

Sortings

1. Insertion Sort
2. Selection Sort
3. Merge Sort
4. Heap Sort (with full data structure)
5. Heap Sort (pure algorithm)
6. Max Priority Queue (Max-heap Application)

Problems

1. Maximum Subarrays (divide and conquer)
2. Maximum Subarrays (dynamic programming)