https://github.com/jollyjerr/algorithms-specialization-notebook

My notes and assignments for Stanford University's Algorithms Specialization
https://github.com/jollyjerr/algorithms-specialization-notebook

algorithms data-structures golang study-notes

Last synced: about 2 months ago
JSON representation

My notes and assignments for Stanford University's Algorithms Specialization

• Host: GitHub
• URL: https://github.com/jollyjerr/algorithms-specialization-notebook
• Owner: jollyjerr
• Created: 2020-12-05T04:33:10.000Z (about 4 years ago)
• Default Branch: main
• Last Pushed: 2024-01-10T13:52:11.000Z (about 1 year ago)
• Last Synced: 2024-01-10T15:47:09.750Z (about 1 year ago)
• Topics: algorithms, data-structures, golang, study-notes
• Language: Go
• Homepage:
• Size: 26.2 MB
• Stars: 1
• Watchers: 1
• Forks: 2
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# algorithms-specialization-notebook

![Tests](https://github.com/jollyjerr/algorithms-specialization-notebook/workflows/Tests/badge.svg)

> My notes and assignments for Stanfords "Algorithms Specialization" class on Coursera

There are 4 courses (quarters from the corresponding university course). Each have 4 week-long sections

## Implementations

### Course 1 - Divide and Conquer, Sorting and Searching, and Randomized Algorithms

[Merge Sort](./course1/week1/mergesort/mergesort.go)

[Karatsuba Multiplication](./course1/week1/karatsuba/karatsuba.go)

[Inversion Counter](./course1/week2/countInversions/countInversions.go)

[Strassen's Subcubic Matrix Multiplication](./course1/week2/strassenMatrix/strassenMatrix.go)

[Quicksort](./course1/week3/quicksort/quicksort.go)

[Randomized Selection](./course1/week4/randomizedSelection/rSelect.go)

[Randomized Contraction](./course1/week4/randomizedContraction/randomizedContraction.go)

### Course 2 - Graph Search, Shortest Paths, and Data Structures

[Breadth First Search](./course2/week1/breadthFirstSearch/breadthFirstSearch.go)

[Undirected Connectivity](./course2/week1/breadthFirstSearch/undirectedConnectivity.go)

[Kosaraju Two Pass and Depth First Search](./course2/week1/depthFirstSearch/kosarajuTwoPass.go)

[Dijkstra's Shortest Path](./course2/week2/dijkstra/dijkstra.go)

[Median Maintenance](./course2/week3/medianMaintenance/medianMaintenance.go)

[Two Sum via Hash Map](./course2/week4/twoSum/twoSum.go)

### Course 3 - Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

[Job Scheduling and minimize weighted sum of completion times](./course3/week1/schedulingJobs/schedulingJobs.go)

[Prim's minimum spanning tree](./course3/week1/prim/prim.go)

[Max-Spacing k-clusterings via kruskal's algorithm](./course3/week2/cluster/cluster.go)

[Huffman optimal binary prefix-free encoding](./course3/week3/huffman/huffman.go)

[Max weight independent set of a path graph](./course3/week3/maxWeightIndependentSet/mwis.go)

[Knapsack problem](./course3/week4/knapsack/knapsack.go)

### Course 4 - Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

[Floyd-Warshall](./course4/week1/floyd/floyd.go)

[Traveling Salesman Problem](./course4/week3/tsp/tsp.go)