Register
Webpage for Algorithms

Recent questions tagged algorithms

0 votes
1 answer
1627
Time complexity
#include<stdio.h> int main() { int sum =0; for(limit=1;limit<=n;limit*=2) { for(i=0;i<limit;i++) { for(j=0;j<n;j+=2) { sum+=j; } for(j=1;j<n;j*=2) { sum*=j; } } } }
#include<stdio.h int main() { int sum =0; for(limit=1;limit<=n;limit*=2) { for(i=0;i<limit;i++) { for(j=0;j<n;j+=2) { sum+=j; } for(j=1;j<n;j*=2) { sum*=j; } } } }
User Avatar
0 votes
0 answers
1628
MadeEasy Test Series: Algorithms - Time Complexity
PS : This question is similar to GATE2004-82, but different, so plz donot close it with duplicate Note, and help in answering
PS : This question is similar to GATE2004-82, but different, so plz donot close it with duplicate Note, and help in answering
User Avatar
2 votes
2 answers
1629
Merge Sort
Let A,B,C,D,E are sorted sequences having length 70,74,80,85,102 respectively.They are merged into a single sequence by merging together two sequences at a time.The minimum number of comparisons that will be needed by algorithm in best case for going merging is _________.
Let A,B,C,D,E are sorted sequences having length 70,74,80,85,102 respectively.They are merged into a single sequence by merging together two sequences at a time.The minim...
User Avatar
0 votes
1 answer
1630
me test
Let $f (n) = Ο(n), g(n) = \Omega(n)$ and $h(n) = \theta(n)$. Then $g(n) + f(n).h(n)$ is ______ How to solve such examples. Rules for math of asymptotic notations(mul,div,add,sub of diif notations)
Let $f (n) = Ο(n), g(n) = \Omega(n)$ and $h(n) = \theta(n)$. Then $g(n) + f(n).h(n)$ is ______How to solve such examples.Rules for math of asymptotic notations(mul,div,a...
User Avatar
1 votes
1 answer
1631
me test series
how the tc is O(n^4)
how the tc is O(n^4)
User Avatar
2 votes
1 answer
1632
Equivalent Complexity
Given f(n) = ω(n2). Which of the following can never hold? a. f(n) = O (n3) b. f(n) = Ω (n2) c. f(n) = θ (n2) d. f(n) = ω (n)
Given f(n) = ω(n2).Which of the following can never hold?a. f(n) = O (n3)b. f(n) = Ω (n2)c. f(n) = θ (n2)d. f(n) = ω (n)
User Avatar
2 votes
1 answer
1633
MadeEasy Test Series 2018: Algorithms - Dynamic Programming
The number of balance parenthesis possible with 5-pairs of parenthesis _________. [ Assume ( ) and (( )) is balance parenthesis but not ) ( ]
The number of balance parenthesis possible with 5-pairs of parenthesis _________. [ Assume ( ) and (( )) is balance parenthesis but not ) ( ]
User Avatar
3 votes
1 answer
1636
#distinct MSTs
......................................................
......................................................
User Avatar
1 votes
0 answers
1638
Gate_2018_Mock_Test
is there is any short cut ? I am using prism algoritham ...its tak too much time
is there is any short cut ? I am using prism algoritham ...its tak too much time
User Avatar
1 votes
1 answer
1641
Gate_2018_Model Paper
Please explain the solution
Please explain the solution
User Avatar
2 votes
1 answer
1642
Algorithms:Asymptotic Notations
plz help me . how to solve that type of question
plz help me . how to solve that type of question
User Avatar
3 votes
1 answer
1646
From Geeksforgeeks
Given A, an array of size n, comprised of an increasing sequence of numbers followed immediately by a decreasing one. What is worst case time complexity of optimal algorithm to determine if a given number x is in the array?
Given A, an array of size n, comprised of an increasing sequence of numbers followed immediately by a decreasing one. What is worst case time complexity of optimal algori...
User Avatar
1 votes
3 answers
1648
Dijkstra Algorithm
I think answer should be Option(B). Path:<s,y><y,x><x,t> = 7-3-2=2
I think answer should be Option(B).Path:<s,y><y,x><x,t = 7-3-2=2
User Avatar
1 votes
2 answers
1649
Worst Case Time Complexity
What is the worst case time complexity to find kth smallest element into an array of ‘n’ element?
What is the worst case time complexity to find kth smallest element into an array of ‘n’ element?
User Avatar
1 votes
1 answer
1650
Algorithms
A sorting algorithm is stable if duplicate elements remain in the same relative position after sorting. What is the meaning of this statement
A sorting algorithm is stable if duplicate elements remain in the same relative position after sorting.What is the meaning of this statement
User Avatar
Page: