https://github.com/aviaryan/algorithms-course
Things I learned/did in my 4th semester algorithms course
https://github.com/aviaryan/algorithms-course
Last synced: 3 months ago
JSON representation
Things I learned/did in my 4th semester algorithms course
- Host: GitHub
- URL: https://github.com/aviaryan/algorithms-course
- Owner: aviaryan
- License: mit
- Created: 2016-01-18T04:19:17.000Z (over 9 years ago)
- Default Branch: master
- Last Pushed: 2016-02-23T20:28:28.000Z (over 9 years ago)
- Last Synced: 2025-03-11T11:26:08.509Z (7 months ago)
- Language: C++
- Homepage:
- Size: 15.6 KB
- Stars: 4
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
## Algorithms Course (4th semester)
All my code is in C++
#### Lab 1
* [direct_address.cpp](lab1/direct_address.cpp) - Implement direct addressing in a table.
* [hashing_with_chaining.cpp](lab1/hashing_with_chaining.cpp) - Implement hashing with chaining.
* [linear_probing.cpp](lab1/linear_probing.cpp) - Implement hashing by probing using different schemes. Take care of deleted slots and differentiate them from slots never occupied.
* [queue_2stacks.cpp](lab1/queue_2stacks.cpp) - Queue built using 2 stacks.
* [sort_2_queues.cpp](lab1/sort_2_queues.cpp) and [sort_1_queue.cpp](lab1/sort_1_queue.cpp) - Write a routine for changing a sequence of elements in a queue according to a specified input permutation using two temporary queues. Do the same using a single temporary queue.
* [sort_2_stacks.cpp](lab1/sort_2_stacks.cpp) - Write a routine for changing a sequence of elements in a stack according to a specified permutation using two temporary stacks.
* [conditional_queue_stack.cpp](lab1/conditional_queue_stack.cpp) - A data structure that behaves like both stack and queue. If number of elements in it is more than 8, then deletion takes place like stack (LIFO) otherwise like queue (FIFO).
* [stack_transfer.cpp](lab1/stack_transfer.cpp) - Tower of Hanoi using stacks
#### Lab 2
* [merge-sort.cpp](lab2/merge-sort.cpp) - Implement the standard equal-split version of merge sort.
* [mergesort_sorted_grouped.cpp](lab2/mergesort_sorted_grouped.cpp) - Implement the scan, divide-into-maximal-monotonic-increasing-subarrays, merge variant of merge sort.
* [find_rank.cpp](lab2/find_rank.cpp) - Consider an array A indexed from 1 to n, such that for some unknown index k, 1 <= k <= n, the minimum element is at position k. The elements are placed in increasing order rightwards, starting with the minimum at position k and wrapping around at position n and continuing from position 1 to position kâ1. Find rank of an element in O(Log N) worst time.
#### Mid-semester
* [heapsort.cpp](midsem/heapsort.cpp) - Implement Heapsort