Algorithms icon indicating copy to clipboard operation
Algorithms copied to clipboard

A Repository for algorithms in C, C++, Python and Java

Results 115 Algorithms issues
Sort by recently updated
recently updated
newest added

Given an array of disk track numbers and initial head position, we need to find the total number of seek operations done to access all the requested tracks if First...

no-issue-activity

A balanced binary tree, also referred to as a height-balanced binary tree, is defined as a binary tree in which the height of the left and right subtree of any...

no-issue-activity

In operating systems, whenever a new page is referred and not present in memory, page fault occurs and Operating System replaces one of the existing pages with newly needed page....

no-issue-activity

The XOR Linked List is a variation of a linked list where each node stores the XOR (exclusive OR) of the addresses of its previous and next nodes. It is...

no-issue-activity

A Bloom filter is a space-efficient probabilistic data structure used to test whether an element is a member of a set. It provides an efficient way to perform set membership...

no-issue-activity

## **Is** your feature request related to a problem? Please describe. Yes, I would like to work on this algorithm. ## **Describe** the solution you'd like I will add appropriate...

no-issue-activity

**Is your feature request related to a problem? Please describe.** There is no description in the readme file of of Cryptography in Java section. I am not able to properly...

no-issue-activity

Cartesian Sort is an Adaptive Sorting as it sorts the data faster if data is partially sorted. In fact, there are very few sorting algorithms that make use of this...

no-issue-activity

Title: Add Dancing Links Algorithm for Exact Cover Problems Description: The Dancing Links algorithm is a powerful technique used for solving exact cover problems, such as Sudoku puzzles, pentomino tiling,...

no-issue-activity

Title: Add Count-Min Sketch Algorithm for Efficient Frequency Counting Description: The Count-Min Sketch algorithm is a powerful probabilistic data structure used for efficient frequency counting in large data sets. Currently,...

no-issue-activity