Skip to content

Summary notes for my "Algorithms and Data Structures" class

Notifications You must be signed in to change notification settings

Lencripe/fit2004-notes

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

42 Commits
 
 
 
 

Repository files navigation

Algorithms and Data Structures

Summary Notes by Carlos Melegrito

In this repo is everything I've learned while studying the FIT2004 unit at Monash University. It's a collection of summary notes, algorithms and their explanations useful in many areas of computer science. To use these notes, follow along the links in the contents below like a guidebook.

Contents

Formalities

Sorting Algorithms

Dynamic Programming (Examples)

Efficient Lookup and Retrieval

Compression

Graph Algorithms

Tree Algorithms

Directed Acyclic Graphs

Numerical Algorithms

P vs NP

Primes

Algorithmic Design Principles

About

Summary notes for my "Algorithms and Data Structures" class

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published