Register
Webpage for Algorithms

Recent questions tagged algorithms

0 votes
0 answers
1921
Algorithm
1. What is the time complexity to design BST from given postorder and inorder traversal? 2. What is the time complexity to design BST from given postorder only. I know time to design BST from Preorder is O(n).
1. What is the time complexity to design BST from given postorder and inorder traversal?2. What is the time complexity to design BST from given postorder only. I know tim...
User Avatar
4 votes
1 answer
1922
AceTest Series: Algorithms - Time Complexity
for (i=n ; i>0 ; i--) { for ( j=1;j<n ; j=j*2) { for ( k=0;k<j ;k++) { } } } time complexity ?? how to find of inner and innermost loop?
for (i=n ; i>0 ; i ) { for ( j=1;j<n ; j=j*2) { for ( k=0;k<j ;k++) { } } }time complexity ??how to find of inner and innermost loop?
User Avatar
4 votes
1 answer
1923
What can be the big oh?
What will be the Big Oh for $n!$ ? As we can deduce log($n!$) = O(log n) . Is there any proof like we have for log($n!$) ?
What will be the Big Oh for $n!$ ?As we can deduce log($n!$) = O(log n) .Is there any proof like we have for log($n!$) ?
User Avatar
2 votes
1 answer
1924
CLR 3rd Edition page no. 42 Q.n. c
Wha is the relationship between the running time of insertion sort and the number of inversions in the input array ? Is the circled text should be greater instead of less .Plz justify . PS: This image has been taken from solun manual of CLR.
Wha is the relationship between the running time of insertion sort and the number of inversions in the input array ?Is the circled text should be greater instead of less ...
User Avatar
1 votes
2 answers
1926
Self Doubt
What will be the time complexity of A() { int i,j,k,n; for(i=1;i<=n;i++) { for(j=1;j<=(i^2);j++) { for(k=1;k<=(n/2);k++) { printf("ABCD"); } } } }
What will be the time complexity of A() { int i,j,k,n; for(i=1;i<=n;i++) { for(j=1;j<=(i^2);j++) { for(k=1;k<=(n/2);k++) { printf("ABCD"); } } } }
User Avatar
1 votes
1 answer
1927
Self Doubt
What will be the time complexity of the following code? A() { int i,j,k,n; for(i=1;i<=n;i++) { for(j=1;j<=i;j++) { for(k=1;k<=100;k++) { printf("ABCD"); } } } }
What will be the time complexity of the following code?A() { int i,j,k,n; for(i=1;i<=n;i++) { for(j=1;j<=i;j++) { for(k=1;k<=100;k++) { printf("ABCD"); } } } }
User Avatar
5 votes
1 answer
1929
Algo: Time complexity
T(n) = 4T(n/2) + n2.$\sqrt{2}$ In thetha notation?
T(n) = 4T(n/2) + n2.$\sqrt{2}$In thetha notation?
User Avatar
1 votes
1 answer
1934
Master Theorem
User Avatar
3 votes
0 answers
1935
Self Doubt ( Decrease key operation )
While going through dijkstra's algorithm, there is a term "decrease key". I am not getting the meaning when it says "we do decrease key operation". What exactly we do and what is the meaning of decrease key ?
While going through dijkstra's algorithm, there is a term "decrease key". I am not getting the meaning when it says "we do decrease key operation". What exactly we do and...
User Avatar
2 votes
1 answer
1936
Asymptotic time order
User Avatar
0 votes
0 answers
1937
Spanning Tree
User Avatar
4 votes
1 answer
1939
Merge sort
True or False Merge sort on Linked list takes O(nlogn)
True or FalseMerge sort on Linked list takes O(nlogn)
User Avatar
2 votes
1 answer
1940
priority based scheduling
Given that ready contains at some point of time a maximum of n process , the time complexity to schedule and dispatch a process from ready queue onto CPU using priority based scheduling is a)O(n) b)O(logn) c)O(nlogn) d)O(1)
Given that ready contains at some point of time a maximum of n process , the time complexity to schedule and dispatch a process from ready queue onto CPU using priority ...
User Avatar
3 votes
1 answer
1941
Time complexity
Solve the following recurrence relation $T(n)=4T(n/2)+n^2 \sqrt 2$
Solve the following recurrence relation$T(n)=4T(n/2)+n^2 \sqrt 2$
User Avatar
2 votes
2 answers
1942
CLRS Divide-and-Conquer Strassens's algorithm
Do we need to study the Strassens's algorithm in detail like proof or working of that algorithm or we just need to know the time complexity of the algorithm because I can't find it's explanation anywhere?
Do we need to study the Strassens's algorithm in detail like proof or working of that algorithm or we just need to know the time complexity of the algorithm because I can...
User Avatar
3 votes
1 answer
1945
Time complexity
f(n)=Ω(n),g(n)=O(n) than what is f(n).g(n)
f(n)=Ω(n),g(n)=O(n) than what is f(n).g(n)
User Avatar
3 votes
1 answer
1946
CMI Question
Selection of the kth smallest element in a set of n elements. O(n) O(n^2). Reason.
Selection of the kth smallest element in a set of n elements.O(n)O(n^2).Reason.
User Avatar
4 votes
4 answers
1947
Ace Test Series: Algorithms - Sorting
Consider bottom-up merge sort working on 'n' elements. Assume 'n' is a power of 2. The minimum number of comparisons in order to get sorted list is (A) (n log n) / 2 (B) n lon n - n + 1 (C) n log n (D) n log n + n
Consider bottom-up merge sort working on 'n' elements. Assume 'n' is a power of 2. The minimum number of comparisons in order to get sorted list is(A) (n log n) / 2(B) n ...
User Avatar
1 votes
1 answer
1948
Algo:- BFS
If in a given graph all edge weights are equal and negative then BFS will correctly find out single source shortest path to all vertices,starting from vertex v? True/False?
If in a given graph all edge weights are equal and negative then BFS will correctly find out single source shortest path to all vertices,starting from vertex v? True/Fals...
User Avatar
1 votes
2 answers
1949
algorithm
.Let S1= ∑nr/2r (r=0 to logn-1) .S2= ∑r2r (r=0 to logn-1) what will be s1 and and s2 after expension
.Let S1= ∑nr/2r (r=0 to logn-1) .S2= ∑r2r (r=0 to logn-1)what will be s1 and and s2 after expension
User Avatar
5 votes
5 answers
1950
Matrix Chain
Total no. of ways to perform matrix multiplication having 7 matrices is ? Total no. of ways to by which we could parenthesize 7 matrices is ? Does the above two questions are different or same ? Plz explain the answer.
Total no. of ways to perform matrix multiplication having 7 matrices is ?Total no. of ways to by which we could parenthesize 7 matrices is ?Does the above two questions ...
User Avatar
Page: