Register

Please solve this Q

• retagged by
252 views
1 votes
1 votes

What could be the best algorithm from the following when the time complexity is measured based bon the number of swaps performed by the sorting algorithm?

1. Selection sort

2.  Insertion sort

3. Bubble sort

4. None of these
• retagged by
User Avatar

1 Answer

1 votes
1 votes
selection sort max n-1 swap

insertion sort max n(n-1)/2 swap

bubble sort max n*(n-1)/2 swap
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

4 votes
4 votes
3 answers
1
kallu singh asked Jan 20, 2018
472 views
please solve this Q
User Avatar
1 votes
1 votes
1 answer
2
kallu singh asked Aug 13, 2017
445 views
Please Solve this Q
In the following C function, let n >= m. int gcd(n,m) { if (n%m ==0) return m; n = n%m; return gcd(m,n); } How many recursive calls are made by this function? (A) (logn)? (B) (n) (C) (loglogn) (D) (sqrt(n))
In the following C function, let n >= m.int gcd(n,m) { if (n%m ==0) return m; n = n%m; return gcd(m,n); }How many recursive calls are made by this function? (A) (logn)?(B...
User Avatar
0 votes
0 votes
1 answer
3
kallu singh asked Sep 7, 2018
642 views
Solve this Q
Consider the following C code segment int f (int x) { if (x < 1) return 1; else return (f(x-1) + g(x)) } int g (int x) { if (x < 2) return 2; else return (f(x-1) + g(x/2)); } Of the following, which best describes the growth of f(x) as a function of x? (A) Linear (B) Exponential (C) Quadratic (D) Cubic
Consider the following C code segmentint f (int x) { if (x < 1) return 1; else return (f(x-1) + g(x)) } int g (int x) { if (x < 2) return 2; else return (f(x-1) + g(x/2))...
User Avatar
1 votes
1 votes
1 answer
4
iarnav asked Mar 29, 2018
527 views
Please help me solve this Recurrence Relation
*****NOTE: I'm not looking to find the Time Complexity, but I'm looking for number of comparisons and the answer is 3/2n -2 T(n) = 2T(n/2) +2 T(2) = 1 T(1) = 0 and I'm stuck at this point - T(n)= 2k T(n/2k) + 2k+2k-1+ . . . +2 and I found out k = log n-1, but stuck at solving for k.
*NOTE: I'm not looking to find the Time Complexity, but I'm looking for number of comparisons and the answer is3/2n -2T(n) = 2T(n/2) +2 T(2) = 1T(1) = 0and I'm stuck at...
User Avatar
Link Copied!