https://github.com/rahulbisht001/daa_bootcamp
https://github.com/rahulbisht001/daa_bootcamp
algorithms c cpp design-and-analysis-of-algorithms
Last synced: 2 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/rahulbisht001/daa_bootcamp
- Owner: RahulBisht001
- Created: 2023-03-11T12:15:14.000Z (over 3 years ago)
- Default Branch: main
- Last Pushed: 2023-06-30T16:38:14.000Z (about 3 years ago)
- Last Synced: 2025-01-27T12:21:16.857Z (over 1 year ago)
- Topics: algorithms, c, cpp, design-and-analysis-of-algorithms
- Language: C
- Homepage:
- Size: 891 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
## DAA-Bootcamp
* Binary Search Recurrence Relation : `T(n) = T(n/2) + 1`
where `T(n)` is the time required for binary search in an array of size n.
* Recurrence Relation of Tower of Hanoi : `T(n) = 2* T(n -1) + 1`
* Recurrence Relation of Quick Sort : `T(n) = T(n-1) + O(n)`
because we need to sort the subArray of size `n-1` and partition the array of size `n` in
`O(n)` time.
* Recurrence Relation of Merge Sort : `T(n)=2T(n/2) + An`
* Recurrence Relation of Fibonacci series : `T(n) = T(nā1) + T(nā2)`
- [X] fibonacci series
- [X] tower of hanoi
- [ ] jump search
- [ ] quick sort
- [ ] merge sort
- [ ] heap sort
- [ ] 0/1 Knapsack problem
- [ ] Longest common subsequence,
- [ ] Matrix chain multiplication
- [X] Hashing, HashFunction and Collisions
- [ ] String Matching
- [ ] The subset-sum problem
- [ ] The traveling salesman problem