Category: Data Structures and Algorithms

In this article, I will explain How to Perform Universal Hashing. What is Universal Hashing? Universal hashing is a technique used in computer science and cryptography to design and implement hash functions that minimize the likelihood of collisions (i.e., when two different inputs produce the same hash value) while still maintaining good average-case performance. Universal …

In this article, I will explain What is N Queens Problem. Basically, the N Queens Problem is a classic problem in computer science and mathematics. It involves placing N chess queens on an NxN chessboard such that no two queens threaten each other. In other words, no two queens can be placed on the same …

In this article, I will explain What is Bucket Sort Algorithm and how does it work. Bucket Sort is a sorting algorithm that works by distributing the elements of an array into a number of buckets, and then sorting the elements within each bucket. It is useful when the input data is uniformly distributed over …

In this article, I will explain What is Radix Sort and How Does it Work. Radix sort is a non-comparative sorting algorithm that sorts data by processing the digits or characters of the items being sorted. It works by grouping the items to be sorted based on their individual digits or characters, and then sorting …

In this article I will explain What is Randomized Select Algorithm and how does it work. The Randomized Select algorithm is a variation of the QuickSelect algorithm for finding the kth smallest element in an unsorted array. Like QuickSelect, the Randomized Select algorithm has an average time complexity of O(n), where n is the size …