User greybeard

9 votes

Accepted

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

answered Feb 4, 2016 at 17:57

4 votes

Accepted

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

answered Aug 31, 2018 at 5:59

3 votes

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

answered Mar 5, 2019 at 9:02

2 votes

Situation where FFD < BFD

answered Jan 17, 2017 at 22:20

2 votes

Hackerearth practice problem not able to understand

answered Nov 21, 2017 at 7:08

2 votes

Accepted

Access a tree by level without traversing

answered Jan 28, 2018 at 11:00

2 votes

Accepted

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

answered Feb 5, 2020 at 7:10

2 votes

Building a Hyper Computer

answered Dec 8, 2016 at 8:09

2 votes

Set Intersection with asymmetric set sizes

answered Feb 26, 2015 at 5:17

1 vote

Accepted

Memory Address Lines

answered Jul 16, 2021 at 7:20

1 vote

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

answered Oct 4, 2021 at 8:16

1 vote

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

answered Oct 20, 2021 at 5:24

1 vote

Bitwise X-OR properties for competitive programming

answered Jun 6, 2022 at 8:44

1 vote

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

answered Jun 20, 2022 at 6:09

1 vote

Data structure to estimate the frequency of low frequency elements

answered Jan 26 at 9:01

1 vote

Accepted

What decompression algorithms have the shortest implementations?

answered Jun 30, 2016 at 4:57

1 vote

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

answered Jul 9, 2014 at 11:05

1 vote

Accepted

How to detect repeating random numbers?

answered Sep 10, 2014 at 22:10

1 vote

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

answered Oct 26, 2014 at 18:32

1 vote

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

answered May 28, 2019 at 14:19

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

answered Sep 29, 2019 at 8:27

1 vote

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

answered Oct 13, 2019 at 2:00

1 vote

Accepted

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

answered Nov 25, 2019 at 6:03

1 vote

Finding the point with minimum x-ordinate, lying between two y-ordinates

answered Apr 28, 2020 at 20:55

1 vote

Data structure for shopping cart

answered Jul 16, 2020 at 4:28

1 vote

Insertion sort on small arrays in Merge Sort

answered Feb 15, 2021 at 6:20

1 vote

How does a command interpreter/Shell recognize a command?

answered May 19, 2021 at 10:20

0 votes

What are the examples of multi-threading in a web server?

answered Jul 15, 2021 at 2:06

0 votes

Why is memory one dimensional?

answered Mar 17, 2021 at 17:20

0 votes

Find offset and page number given paged virtual memory address

answered Apr 7, 2021 at 9:44

Stack Exchange Network

53 Answers

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

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

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

Situation where FFD < BFD

Hackerearth practice problem not able to understand

Access a tree by level without traversing

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

Building a Hyper Computer

Set Intersection with asymmetric set sizes

Memory Address Lines

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

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

Bitwise X-OR properties for competitive programming

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

Data structure to estimate the frequency of low frequency elements

What decompression algorithms have the shortest implementations?

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

How to detect repeating random numbers?

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

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

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

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

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

Finding the point with minimum x-ordinate, lying between two y-ordinates

Data structure for shopping cart

Insertion sort on small arrays in Merge Sort

How does a command interpreter/Shell recognize a command?

What are the examples of multi-threading in a web server?

Why is memory one dimensional?

Find offset and page number given paged virtual memory address