Skip to main content
greybeard's user avatar
greybeard's user avatar
greybeard's user avatar
greybeard
  • Member for 11 years, 8 months
  • Last seen this week
  • EU
9 votes
Accepted

Where can I find an original reference for this integer square root algorithm

6 votes
Accepted

Nine-input sorting network of optimal depth with minimum number of comparators

4 votes

An algorithm to efficiently insert a list of elements into a binary heap ("bulk insertion")

2 votes

Situation where FFD < BFD

2 votes

Hackerearth practice problem not able to understand

2 votes
Accepted

Access a tree by level without traversing

2 votes
Accepted

Can a 32-bit processor work with a 64-bit size word?

2 votes

Building a Hyper Computer

2 votes
Accepted

What could a neat circuit using full adders implementing selectable arithmetic operations on two 3-bit inputs look like?

2 votes

Set Intersection with asymmetric set sizes

1 vote

Finding longest fibonacci substring in a given string in linear time

1 vote
Accepted

What kind of algorithm is this (box-fill, box-explode)?

1 vote

Top K Most Frequent Elements and Bucket Sorting Intuition

1 vote

How do you compute and compare the delays between a (4:2) compressor and (3,2) counter carry save tree?

1 vote

Closest point on a convex hull in log(n)

1 vote
Accepted

Memory Address Lines

1 vote

Complexity of sorting $k$-sorted array using QuickSort and HeapSort

1 vote

How to join two Scapegoat Trees in O(log n) time?

1 vote

Bitwise X-OR properties for competitive programming

1 vote

Compute a commutative and associative operation on n-2 arguments efficiently

1 vote

Data structure to estimate the frequency of low frequency elements

1 vote

Same Address and Write signal for two block of RAM?

1 vote
Accepted

What decompression algorithms have the shortest implementations?

1 vote

what's the meaning of LOC(X[j]) = $L_0$ + cj in TAOCP's 5.4.1R?

1 vote
Accepted

How to detect repeating random numbers?

1 vote

explain ackerman's recursion. how long it takes to execute the following code for an average PC

1 vote

Algorithm for fewest moves in 1's, 10's, 100's, etc

1 vote

Creating a priority search tree to find number of points in the range [-inf, qx] X [qy, qy'] from a set of points sorted on y-coordinates in O(n) time

1 vote

How can I make my algorithm more efficient or Is there a better way to solve the problem

1 vote
Accepted

Minimizing a multiple output circuit with K-maps - and without