Tail Recursion Example: Functional Programming Languages
Tail recursion optimization works by maintaining a single call frame for the recursive calls instead of creating a new one each time.
Category: Computer Science
Comparing Performance of Disjoint-Set Algorithms: Quick Union, Quick Find, and Weighted Quick Union
Disjoint-set data structures, commonly known as Union-Find, are fundamental data-structures in computer science for efficiently solving problems related to connectivity in graphs or set operations.
Comparing Order Statistics Algorithm and Min Heap for Finding the Kth Smallest Element
Both methods provide effective solutions for finding the kth smallest element in a list of numbers. Understanding their strengths and trade-offs will help you select the most suitable approach for your use case.
Understanding P, NP, and NP-Complete
This so-called P ≠ NP question has been one of the deepest, most perplexing open research problems in theoretical computer science.
Time & Space complexity [Cheat Sheet]
Time Complexity is the number of primitive operations executed on a particular input. It measures the amount of time an algorithm takes to complete as a function of the length of the input.