The A5Cipher class implements the A5/1 stream cipher, which is a widely used encryption algorithm, particularly in mobile communications. This implem

The A5KeyStreamGenerator class is responsible for generating key streams for the A5/1 encryption algorithm using a combination of Linear Feedback Shif

The ADFGVX cipher is a fractionating transposition cipher that was used by the German Army during World War I. It combines a Polybius square substitu

This class is build to demonstrate the application of the AES-algorithm on a single 128-Bit block of data.

This example program shows how AES encryption and decryption can be done in Java. Please note that secret key and encrypted text is unreadable binary

AND Gate implementation. Returns true if all inputs are true; otherwise, false.

AStar class implements the A pathfinding algorithm to find the shortest path in a graph. The graph is represented using an adjacency list, and the alg

Represents an AVL Tree, a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one.

A class that provides a solution to the abbreviation problem. Problem: Given two strings, `a` and `b`, determine if string `a` can be transformed int

In number theory, an abundant number or excessive number is a positive integer for which the sum of its proper divisors is greater than the number. Eq

Merges account records using Disjoint Set Union (Union-Find) on shared emails. <p>Input format: each account is a list where the first element is the

A class representing the adjacency list of a directed graph. The adjacency list maintains a mapping of vertices to their adjacent vertices. @param <E

AdjacencyMatrixGraph Implementation

The AffineCipher class implements the Affine cipher, a type of monoalphabetic substitution cipher. It encrypts and decrypts messages using a linear tr

A utility class to perform affine transformations of the form: y = slope x + intercept. This class supports inversion and composition of affine trans

AgingScheduling is an algorithm designed to prevent starvation by gradually increasing the priority of waiting tasks. The longer a process waits, the

This class contains test cases for the Aho-Corasick String Matching Algorithm. The Aho-Corasick algorithm is used to efficiently find all occurrences

In number theory, the aliquot sum s(n) of a positive integer n is the sum of all proper divisors of n, that is, all divisors of n other than n itself.

This class provides a solution to the "All Construct" problem. The problem is to determine all the ways a target string can be constructed from a giv

Finds all possible simple paths from a given source vertex to a destination vertex in a directed graph using backtracking. <p>This algorithm performs

Utility class for checking whether a string's characters are in non-decreasing lexicographical order based on Unicode code points (case-insensitive).

This class provides a method to arrange two strings by alternating their characters. If one string is longer, the remaining characters of the longer s

Amicable numbers are two different natural numbers that the sum of the proper divisors of each is equal to the other number. (A proper divisor of a nu

An anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.

Class for converting from "any" base to "any" other base, when "any" means from 2-36. Works by going from base 1 to decimal to base 2. Includes auxili

@author Varun Upadhyay (<a href="https://github.com/varunu28">...</a>)

A utility class for converting numbers from any base to any other base. This class provides a method to convert a source number from a given base to

Find the area of various geometric shapes

@author Amarildo Aliaj

An implementation of the Arithmetic Coding algorithm. <p> Arithmetic coding is a form of entropy encoding used in lossless data compression. It encod

This class checks whether a given number is an Armstrong number or not. An Armstrong number is a number that is equal to the sum of its own digits, ea

@author satyabarghav @since 4/10/2023

This class provides methods to find all combinations of integers from 0 to n-1 of a specified length k using backtracking.

Provides a method to perform a left rotation on an array. A left rotation operation shifts each element of the array by a specified number of position

Provides a method to perform a right rotation on an array. A left rotation operation shifts each element of the array by a specified number of positio

The AssignmentUsingBitmask class is used to calculate the total number of ways tasks can be distributed among people, given specific constraints on wh

The Atbash cipher is a classic substitution cipher that substitutes each letter with its opposite letter in the alphabet. For example: - 'A' becomes

Class for linear auto-correlation of a discrete signal @author Athina-Frederiki Swinkels @version 2.0

Test class for AutoCorrelation class @author Athina-Frederiki Swinkels @version 2.0

The Autokey Cipher is an interesting and historically significant encryption method, as it improves upon the classic Vigenère Cipher by using the plai

<a href="https://en.wikipedia.org/wiki/Automorphic_number">Automorphic Number</a> A number is said to be an Automorphic, if it is present in the last

A utility class for computing the average of numeric arrays. <p>This class provides static methods to calculate the arithmetic mean of arrays of both

The BFPRT (Median of Medians) algorithm implementation. It provides a way to find the k-th smallest element in an unsorted array with an optimal worst

Test Cases for Inverted Index with BM25 @author Prayas Kumar (https://github.com/prayas7102)

Given a sorted array. Create a balanced binary search tree from it. Steps: 1. Find the middle element of array. This will act as root 2. Use the left

@author Albina Gimaletdinova on 20/04/2023

<h1>Binary Search Tree (Iterative)</h1> <p> An implementation of BST iteratively. Binary Search Tree is a binary tree which satisfies three propertie

@author Albina Gimaletdinova on 23/04/2023

<h1>Binary Search Tree (Recursive)</h1> An implementation of BST recursively. In recursive implementation the checks are down the tree First root is

<h1>Binary Search Tree (Recursive) Generic Type Implementation</h1> <p> A recursive implementation of generic type BST. Reference: <a href="https://

Unit tests for BSTRecursiveGeneric class. Covers insertion, deletion, search, traversal, sorting, and display. Author: Udaya Krishnan M GitHub: https