rahul1947 Goto Github PK

sp06-applications-of-hashing

3 Problems from SP04 to be solved using HashMap/ HashSet instead of TreeMap/ TreeSet.

sp07-comparison-of-hashing-implementations

Comparison of Hashing Algorithms - Double Hashing, Robin Hood Hashing Cuckoo Hashing with Java's inbuilt HashMap/ HastSet over million of add(), contains() and remove() operations.

sp08-depth-first-search

Implementation of Depth First Search algorithm for a Directed Acyclic Graph, Connected Components and Topological Orderings using rbk/Graph.java.

sp09-divide-and-conquer

Implementation of divide and conquer algorithm to sort an array of integers - Merge Sort (take1, take2, take3), and O(n) vs O(log n) algorithms for Fibonacci Term using BigInteger Java library, and their comparison.

sp10-dfs-and-divide-and-conquer

Implementation of DFS - strongly connected components on a Directed Graph, using same Object Oriented approach from SP08. Implementation of two versions of partition algorithms of Quick Sort and their comparison. Implementation of Dual-Pivot Quick Sort Algorithm.

sp11-k-largest-elements-and-enumeration

Implementation of O(n) Select Algorithm to find K largest elements and compare it's performance with an Algorithm to find K largest elements using Priority Queue. Implementation of Enumeration algorithms - permutations(), combinations(), heap(), and Knuth's Algorithm L.

sp12-breadth-first-search-and-enumeration

Implementation of an Algorithm to find Diameter of a Tree (represented as a Graph) using BFS, to find Odd-Length Cycle in a Tree. Implementation of Enumeration of all Paths in a connected Graph, and Enumeration of all permutation with alternate parities.

sp13-string-algorithms

Implementation of String Algorithms

tesla-light-show

Collection of my custom light shows.

ut-dallas-cs-6301-cnns