User kelalaka

4 votes

Sorting functions by asymptotic growth

answered Oct 6, 2018 at 15:18

4 votes

Is "super-exponential" a precise definition of algorithmic complexity?

answered Nov 10, 2018 at 20:07

4 votes

If someone has an encrypted message and it's original plaintext, could he guess the private key if it's the one used to encrypt the message?

answered Dec 21, 2021 at 16:09

3 votes

How large is the seed in an encryption algorithm such as stream cipher?

answered Mar 26, 2021 at 12:46

3 votes

Finding a local peak in an array in O(log N)?

answered Nov 5, 2018 at 21:16

3 votes

Accepted

Why is Dijkstra's Algorithm more popular compared to Grassfire algorithm?

answered Oct 12, 2018 at 16:30

2 votes

Logic gate which checks if the input is a negative number and changes its output based on that

answered Nov 4, 2018 at 17:33

2 votes

Accepted

How to properly calculate dependent nested loops for big-O

answered Dec 23, 2018 at 19:25

2 votes

Accepted

How does hashed inverted page table work?

answered Dec 9, 2018 at 18:00

2 votes

Accepted

Recurrence relation of quicksort depending on its pivot

answered Feb 5, 2019 at 8:50

2 votes

Accepted

MergeSort k arbitrary words in linear time

answered Dec 25, 2018 at 10:29

2 votes

Accepted

Do modern computers prevent instructions being executed by audio? If so, how?

answered Nov 8, 2021 at 17:51

2 votes

Accepted

How 'Avalanche Effect' got its name?

answered Mar 3, 2021 at 19:57

2 votes

Accepted

How polynomial interpolation of polynomial multiplication algorithm works?

answered Mar 17, 2021 at 20:40

1 vote

Why is M^e mod N the ciphertext and not just M^e

answered Jan 2, 2022 at 18:38

1 vote

Accepted

What happens in the event of a collision in a crypto hash function?

answered Apr 7, 2022 at 22:33

1 vote

Prooving by Pigeonhole principle

answered Jan 3, 2019 at 18:13

1 vote

How many times is a for loop executed?

answered Feb 26, 2020 at 19:56

1 vote

Time estimation for successful brute force attack

answered Nov 25, 2020 at 18:46

1 vote

Running Dijkstra on particular graph with negative weight

answered Feb 20, 2019 at 13:33

1 vote

How can I create 10-character, unique codes with no collisions, but without being predictable?

answered Oct 26, 2019 at 19:29

1 vote

Accepted

Sorting n element using Fibonacci Heap

answered Dec 17, 2018 at 17:34

1 vote

Accepted

Dijkstra’s shortest path algorithm

answered Dec 18, 2018 at 10:15

1 vote

Accepted

How can I solve the recurrence $T(n) = 4T(n/2) + n^2\log^2n$? (without master theorem)

answered Oct 11, 2018 at 12:58

1 vote

Asymptotic growth of $\log(n^n + n)$

answered Oct 11, 2018 at 20:46

1 vote

Is any State Space Tree always Binary Tree?

answered Oct 6, 2018 at 13:19

1 vote

Optimizing the problem

answered Oct 12, 2018 at 21:03

1 vote

Is it possible to add every word in a file to a set in $\mathrm{O}(n)$ time?

answered Oct 15, 2018 at 7:12

1 vote

Accepted

Strengths and limitations of arrays

answered Oct 16, 2018 at 13:20

1 vote

Asymptotic behavior of $n\sqrt n + n \log n$ & $\log_{100} n$

answered Oct 17, 2018 at 19:15

Stack Exchange Network

43 Answers

Sorting functions by asymptotic growth

Is "super-exponential" a precise definition of algorithmic complexity?

If someone has an encrypted message and it's original plaintext, could he guess the private key if it's the one used to encrypt the message?

How large is the seed in an encryption algorithm such as stream cipher?

Finding a local peak in an array in O(log N)?

Why is Dijkstra's Algorithm more popular compared to Grassfire algorithm?

Logic gate which checks if the input is a negative number and changes its output based on that

How to properly calculate dependent nested loops for big-O

How does hashed inverted page table work?

Recurrence relation of quicksort depending on its pivot

MergeSort k arbitrary words in linear time

Do modern computers prevent instructions being executed by audio? If so, how?

How 'Avalanche Effect' got its name?

How polynomial interpolation of polynomial multiplication algorithm works?

Why is M^e mod N the ciphertext and not just M^e

What happens in the event of a collision in a crypto hash function?

Prooving by Pigeonhole principle

How many times is a for loop executed?

Time estimation for successful brute force attack

Running Dijkstra on particular graph with negative weight

How can I create 10-character, unique codes with no collisions, but without being predictable?

Sorting n element using Fibonacci Heap

Dijkstra’s shortest path algorithm

How can I solve the recurrence $T(n) = 4T(n/2) + n^2\log^2n$? (without master theorem)

Asymptotic growth of $\log(n^n + n)$

Is any State Space Tree always Binary Tree?

Optimizing the problem

Is it possible to add every word in a file to a set in $\mathrm{O}(n)$ time?

Strengths and limitations of arrays

Asymptotic behavior of $n\sqrt n + n \log n$ & $\log_{100} n$