https://github.com/htetmyatthar/6006
This is my repository for playing with algorithms using MIT 6006 course as guideline.
https://github.com/htetmyatthar/6006
c datastructures-algorithms go python3
Last synced: 3 months ago
JSON representation
This is my repository for playing with algorithms using MIT 6006 course as guideline.
- Host: GitHub
- URL: https://github.com/htetmyatthar/6006
- Owner: htetmyatthar
- Created: 2023-12-17T12:29:17.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2024-05-06T08:35:09.000Z (about 1 year ago)
- Last Synced: 2024-05-06T15:18:06.770Z (about 1 year ago)
- Topics: c, datastructures-algorithms, go, python3
- Language: C
- Homepage:
- Size: 56.5 MB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Introduction
This is my repository for playing with algorithms using the study materials of[ MIT 6006](https://ocw.mit.edu/courses/6-006-introduction-to-algorithms-spring-2020) Introduction to Algorithms course.
I will use Python and Golang for this and occassionally C if I am really bored.
I am trying to learn Golang using this course as my guide.
# Why algorithms?
While learning Golang, I found out that the language didn't have any standard library for algorithms and data structures. So I got the chance to learn all those things.
# Program file structures
All the algorithms are made as stand alone ones as much as possibles to understand the content better.
# Testing
Everything will be tested. And you can find that in seperate test files.
For C, memory leaks are detected by valgrind. For Golang, go fmt tool is used to format.
For Python, black formatter is used.
# Model of Computation
Specification for what operations on the machine can be performed in O(1) time.
In this code base, the WORD-RAM is used.
- Machine word: block of a bits(a is word size of a a-bit WORD-RAM)
- Memory: Addressable sequence of machine words
- Processor supports many constant time operations on a O(1) number of words(integer):
- integer arithmethic:(+, -, *, //, %)
- logical operators:(&&, ||, !, ==, <, >, <=, =>)
- bitwise arithmetic: (&, |, <<, >>, ...)
- Given word n, can read word at address n, write word to address n
- Memory address must be able to access every place in memory
- Requirement: a >= # bits to represent largest memory address, i.e., log base 2 of n
- 32-bit words --> max\~**4GB** memory,
- 64-bit words --> max\~**16exabytes** of memory
# Cautions
**Constants matter in algorithms**, you should never assume how fast or slow just judging by their runtimes on worst case(upper bound) ($O$), best cases(lower bound) ($\Omega$), or average cases(tight bound) ($\theta$).
**Don't get fooled by the runtimes, cruch the numbers**
All algorithms and data structures implemented in this are **not** fully optimized, but good enough for introducing the concepts and using it a bit.
All algorithms and data strucutures should be implement, build and use **differently** based on **different use cases**.