Register
Webpage for Algorithms

Recent questions tagged algorithms

0 votes
0 answers
1444
#DS Min Heaps Possible?
The number of possible min-heaps containing each value from {1,1,1,1,1,1,1} exactly once is _______ This is a variance of Gate 2018 question and how will we deal if all values are same?
The number of possible min-heaps containing each value from {1,1,1,1,1,1,1} exactly once is _______This is a variance of Gate 2018 question and how will we deal if all va...
User Avatar
0 votes
1 answer
1445
algo self doubt
consider the following c program A(n) { if(n<=1) return(n2 +n+1) else return(5A(n/2)+3A(n/2)+MA(n)) } where MA(n) has complexity O(n2). 1.what is the recurrence relation for value.? 2.what is the the recurrence relation for time complexity?
consider the following c program A(n){if(n<=1)return(n2 +n+1)elsereturn(5A(n/2)+3A(n/2)+MA(n))}where MA(n) has complexity O(n2).1.what is the recurrence relation for valu...
User Avatar
0 votes
0 answers
1446
Asymptotic Complexity
$T\left ( n,c \right )=\Theta \left ( n \right )$ for $c\leq 2$ $T\left ( c,n \right )=\Theta \left ( n \right )$ for $c\leq 2$ $T\left ( n,n \right )=\Theta \left ( n \right )+T\left ( n,\frac{n}{2} \right )$ How to find complexity for this recurrence relation?
$T\left ( n,c \right )=\Theta \left ( n \right )$ for $c\leq 2$$T\left ( c,n \right )=\Theta \left ( n \right )$ for $c\leq 2$$T\left ( n,n \right )=\Theta \left ( n \rig...
User Avatar
1 votes
1 answer
1447
#DataStructure Heaps Self Doubt.
In a binary Heap of 100 elements time taken to find the 99th element? or in a binary heap on "n" elements, time taken to find (n-1)th element? Note ; I'm not asking about smallest or largest, but simply the 99th element.
In a binary Heap of 100 elements time taken to find the 99th element?or in a binary heap on "n" elements, time taken to find (n-1)th element? Note ; I'm not asking about ...
User Avatar
1 votes
0 answers
1448
Made easy
User Avatar
0 votes
1 answer
1449
#Algorithms Can Heapsort be applied on Min Heap Data Structure?
I've read and been told that Heapsort can only be applied on Max heap, but this article for G4G states otherwise - https://www.geeksforgeeks.org/heap-sort-for-decreasing-order-using-min-heap/ So, is it true that HS can be applied also on Min heap?
I've read and been told that Heapsort can only be applied on Max heap, but this article for G4G states otherwise - https://www.geeksforgeeks.org/heap-sort-for-decreasing-...
User Avatar
0 votes
1 answer
1452
Heap Sort
Would it be possible to implement a variant of heapsort based on a perfectly balanced ternary structure in which the children of node $i$ are at positions $3i - 1, 3i$, and $3i + 1$, and if so what would be the advantages and disadvantages of the new method?
Would it be possible to implement a variant of heapsort based on a perfectly balanced ternary structure in which the children of node $i$ are at positions $3i - 1, 3i$, a...
User Avatar
2 votes
1 answer
1453
Algorithm
Which of the given options provides the increasing order of asymptotic complexity of functions $f1$, $f2$, $f3$ and $f4$? $f1(n) = 2^n \\ f2(n) = n^{(3/2)} \\ f3(n) = nlogn \\ f4(n) = n^{(logn)}$ How $n^{3/2}$ is greater than $n^{logn}$
Which of the given options provides the increasing order of asymptotic complexity of functions $f1$, $f2$, $f3$ and $f4$? $f1(n) = 2^n \\ f2(n) = n^{(3/2)} \\ f3(n) = nl...
User Avatar
0 votes
1 answer
1454
time complexity
what is the time complexity of the $pow(m,n)$ ?
what is the time complexity of the $pow(m,n)$ ?
User Avatar
0 votes
0 answers
1455
How to calculate the average case time complexity in linear search for a successful and unsuccessful search ?
Successful Search we assume that the probability of searching or finding an element at each location is same , then if we have n elements so probability is $1/n$...Also w...
User Avatar
0 votes
1 answer
1456
Time complexity
$T(n) = T(n-2) + 2logn, \text{ if } n>1 \\ =1, \text{ if } n=1$ Find the Time Complexity.
$T(n) = T(n-2) + 2logn, \text{ if } n>1 \\ =1, \text{ if } n=1$Find the Time Complexity.
User Avatar
0 votes
1 answer
1457
Time complexity
What is the time complexity of the following recursive function : int DoSomething(int n) { if (n <= 2) return 1; else return DoSomething(floor(sqrt(n)))+ n; } $\theta(n^2)$ $\theta(n \log_2 n)$ $\theta(\log_2 n)$ $\theta(\log_2 \log_2 n)$
What is the time complexity of the following recursive function :int DoSomething(int n) { if (n <= 2) return 1; else return DoSomething(floor(sqrt(n)))+ n; }$\theta(n^2)$...
User Avatar
1 votes
0 answers
1458
Time Complexity
What will be the time complexity of the following algorithm ? A(n){ if(n<=1) return 1; for(i=1;i<n;i++){ for(j=0;j<3;j++){ A(n-1) } } }
What will be the time complexity of the following algorithm ?A(n){if(n<=1) return 1;for(i=1;i<n;i++){ for(j=0;j<3;j++){ A(n-1) } }}
User Avatar
0 votes
1 answer
1459
me wk book
let T be a minimum cost spanning tree of G. suppose that ewe decreased the weight of one of the edge in T.then to check modified T is MST or not how much tym will take??? O(1) or O(n)?????
let T be a minimum cost spanning tree of G. suppose that ewe decreased the weight of one of the edge in T.then to check modified T is MST or not how much tym will take???...
User Avatar
0 votes
0 answers
1460
Sorting
You are asked to sort 15 randomly generated numbers. One should prefer - 1. Bubble Sort 2. Quick Sort 3. Merge Sort 4. Heap Sort Please explain why others 3 sorting algorithms except the answer can't be used ?
You are asked to sort 15 randomly generated numbers. One should prefer - 1. Bubble Sort2. Quick Sort3. Merge Sort4. Heap Sort Please explain why others 3 sorting algorith...
User Avatar
0 votes
0 answers
1461
Fibonacci number
How "a fibonacci algorithm runs in polynomial time in n but the optimal running time is exponential in n."? Is it possible to running same algorithm in both polynomial and exponential time?
How "a fibonacci algorithm runs in polynomial time in n but the optimal running time is exponential in n."?Is it possible to running same algorithm in both polynomial and...
User Avatar
0 votes
1 answer
1462
workbook
An unordered list contains n distinct elements. The number of comparisons to find an element in this list that is neither 2nd maximum nor 2nd minimum is Θ(nlogn) Θ(n) Θ(logn) Θ(1)
An unordered list contains n distinct elements. The number of comparisons to find an element in this list that is neither 2nd maximum nor 2nd minimum isΘ(nlogn)Θ(n)Θ(l...
User Avatar
0 votes
0 answers
1463
Backtracking Vs Branch and Bound Paradigm Vs Dynamic Programming Vs Greedy Algorithm
I am getting confused among the terms : Backtracking, Branch and Bound Paradigm, Dynamic Programming and Greedy Algorithm. Can anyone tell their similarities and differences?
I am getting confused among the terms : Backtracking, Branch and Bound Paradigm, Dynamic Programming and Greedy Algorithm.Can anyone tell their similarities and differenc...
User Avatar
0 votes
0 answers
1465
data structure
how does linux kernel uses the red black tree property ???elabourate
how does linux kernel uses the red black tree property ???elabourate
User Avatar
0 votes
0 answers
1466
Data structure
I have a matrix A (m * n) and another matrix B (n * k) of size 1,000000000000000000 (this means it cannot directly save it into memory) . It has been organized as a splay tree. You have to multiply them and give me C (m * k) . What datastructure would be use ? How would implement it ?
I have a matrix A (m * n) and another matrix B (n * k) of size 1,000000000000000000 (this means it cannot directly save it into memory) . It has been organized as a spla...
User Avatar
0 votes
1 answer
1467
#DataStructure Time Complexity in Sorted Array.
Given an sorted array in descending order, what will be the time complexity to delete the minimum element from this array?
Given an sorted array in descending order, what will be the time complexity to delete the minimum element from this array?
User Avatar
0 votes
2 answers
1468
gate 1987
In GATE 1987 question, order of $\Sigma$O(n)$ was found to be $O(n^2)$. Similarly, what will be the answer for order of $\Sigma$O(n^2)$ ? Will it be of $O(n^3)$ ? Thanks!
In GATE 1987 question, order of $\Sigma$$O(n)$ was found to be $O(n^2)$.Similarly, what will be the answer for order of $\Sigma$$O(n^2)$ ? Will it be of $O(n^3)$ ?Thanks...
User Avatar
0 votes
0 answers
1469
Algo: Time Complexity
What is the time complexity of the following piece of code in the terms of n? $Main()$ { $n=2^{2^k};$ $for(i=1; i<=n; i++)$ { $j=2;$ $while(j<=n)$ { $j=j^2;$ } } }
What is the time complexity of the following piece of code in the terms of n?$Main()${$n=2^{2^k};$$for(i=1; i<=n; i++)${ $j=2;$ $while(j<=n)$ { $j=j^2;$ }}...
User Avatar
Page: