Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged time-complexity
3
votes
2
answers
61
In QuickSort algorithm, which of the following statements is NOT true regarding the partition process?
In QuickSort algorithm, which of the following statements is NOT true regarding the partition process?a) Partition always divides the array into two non-empty subsets.b) ...
dhruba
986
views
dhruba
asked
Jun 5, 2023
Algorithms
algorithms
quick-sort
time-complexity
array
+
–
0
votes
1
answer
62
Consider a divide and conquer algorithm that divides an input of size n into a subproblems, each of size n/b, and the cost of dividing and merging the problems is given by f(n) = Θ(n^c). The Master Theorem classifies this into different cases based on the value of c in relation to log_b(a). Could you explain the intuition and reasoning behind these classifications?
Consider a divide and conquer algorithm that divides an input of size n into a subproblems, each of size n/b, and the cost of dividing and merging the problems is given b...
dhruba
402
views
dhruba
asked
May 29, 2023
Algorithms
algorithms
time-complexity
divide-and-conquer
+
–
0
votes
0
answers
63
Algorithm
Çșȇ ʛấẗẻ
292
views
Çșȇ ʛấẗẻ
asked
May 11, 2023
Algorithms
algorithms
time-complexity
sorting
+
–
0
votes
1
answer
64
Self Doubt
An adjacency list representation of an undirected simple graph G = (V, E), each edge (u, v) has two adjacency list entries: [v] in the adjacency list of u, and [u] in the adjacency list of v. These are called twins of each other. A twin ... is not a constraint, what is the time complexity of the most efficient algorithm to set the twin pointer in each entry in each adjacency list?
An adjacency list representation of an undirected simple graph G = (V, E), each edge (u, v) has two adjacency list entries: [v] in the adjacency list of u, and [u] in th...
Psy Duck
365
views
Psy Duck
asked
Mar 29, 2023
Algorithms
algorithms
time-complexity
+
–
7
votes
1
answer
65
GO Classes 2023 | IIITH Mock Test 1 | Question: 12
A list of $n$ arrays, each of length $n$, is passed to an algorithm like merge-sort. The algorithm recursively divides a set of arrays into two parts until there are only two arrays. If there are two arrays, then, as a base case, the algorithm combines or merges both in cost of ... $T(n)=2 T(n / 2)+n$ $T(n)=2 T(n / 2)+n^ 3$ None of these
A list of $n$ arrays, each of length $n$, is passed to an algorithm like merge-sort. The algorithm recursively divides a set of arrays into two parts until there are only...
GO Classes
979
views
GO Classes
asked
Mar 26, 2023
Algorithms
goclasses2023-iiith-mock-1
goclasses
algorithms
recurrence-relation
asymptotic-notation
time-complexity
merge-sort
1-mark
+
–
Page:
« prev
1
2
3
4
5
6
7
8
...
53
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register