Assume that the algorithms considered here sort the input sequences in ascending order. If the input is already in ascending order, which of the following are TRUE ?I. Quicksort runs in (n2) timeII. Bubblesort runs in (n2) timeIII. Mergesort runs in (n) timeIV. Insertion sort runs in (n) timea)I and II onlyb)I and III onlyc)II and IV onlyd)I and IV onlyCorrect answer is option 'D'. Can you explain this answer? - EduRev Computer Science Engineering (CSE) Question

Explore Courses UPSC Exam UPSC Test Series Free Notes EduRev Infinity

Open App

Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > Assume that the algorithms considered here so...

Join the Discussion on the App

Assume that the algorithms considered here sort the input sequences in ascending order. If the input is already in ascending order, which of the following are TRUE ?

I. Quicksort runs in Θ(n²) time
II. Bubblesort runs in Θ(n²) time
III. Mergesort runs in Θ(n) time
IV. Insertion sort runs in Θ(n) time

a)
I and II only
b)
I and III only
c)
II and IV only
d)
I and IV only

Correct answer is option 'D'. Can you explain this answer?

FREE This question is part of

Test: Asymptotic Worst Case Time & Space Complexity- 3

Attempt Test

Attempt this Test

Verified Answer

Assume that the algorithms considered here sort the input sequences in...

I. Given an array in ascending order, Recurrence relation for total number of comparisons for quicksort will be T(n) = T(n-1)+O(n) //partition algo will take O(n) comparisons in any case. = O(n^2)
II. Bubble Sort runs in Θ(n^2) time If an array is in ascending order, we could make a small modification in Bubble Sort Inner for loop which is responsible for bubbling the kth largest element to the end in kth iteration. Whenever there is no swap after the completion of inner for loop of bubble sort in any iteration, we can declare that array is sorted in case of Bubble Sort taking O(n) time in Best Case.
III. Merge Sort runs in Θ(n) time Merge Sort relies on Divide and Conquer paradigm to sort an array and there is no such worst or best case input for merge sort. For any sequence, Time complexity will be given by following recurrence relation, T(n) = 2T(n/2) + Θ(n) // In-Place Merge algorithm will take Θ(n) due to copying an entire array. = Θ(nlogn)
IV. Insertion sort runs in Θ(n) time Whenever a new element which will be greater than all the elements of the intermediate sorted sub-array (because given array is sorted) is added, there won't be any swap but a single comparison. In n-1 passes we will be having 0 swaps and n-1 comparisons. Total time complexity = O(n) // N-1 Comparisons

//// For an array already sorted in ascending order, Quicksort has a complexity Θ(n²) [Worst Case] Bubblesort has a complexity Θ(n) [Best Case] Mergesort has a complexity Θ(n log n) [Any Case] Insertsort has a complexity Θ(n) [Best Case]

View all questions of this test

View all answers Start learning for free

< Previous Question Next Question >

Explore Courses for Computer Science Engineering (CSE) exam

Similar Computer Science Engineering (CSE) Doubts

Assume that the algorithms considered here sort the input sequences in ascending order. If the input is already in ascending order, which of the following are TRUE?I. Quicksort runs in Θ(n2) timeII. Bubblesort runs in Θ(n2) timeIII. Mergesort runs in Θ(n) timeIV. Insertion sort runs in Θ(n) time

View answer

Which of the following is not true about comparison based sorting algorithms?

View answer

Consider a list of recursive algorithms and a list of recurrence relations as shown below. Each recurrence relation corresponds to exactly one algorithm and is used to derive the time complexity of the algorithm.Which of the following is the correct match between the algorithms and their recurrence relations?

View answer

Consider a list of recursive algorithms and a list of recurrence relations as shown below. Each recurrence relation corresponds to exactly one algorithm and is used to derive the time complexity of the algorithm.List-I (Recursive Algorithm)P. Binary searchQ. Merge sortR. QuicksortS. Tower of HanoiList-li (Recurrence Relation)Which of the following is the correct match between the algorithms and their recurrence relations?

View answer

An algorithm to find the length of the longest monotonically increasing sequence of numbers in an array is given below.Let Li denote the length of the longest monotonically increasing sequence starting at index i in the arrayInitialize Ln-1 =1For all i such that 0 i n 2Finally the length of the longest monotonically increasing sequence is MaxQ.Which of the following statements is TRUE?

View answer

Top Courses for Computer Science Engineering (CSE)View all

GATE Computer Science Engineering(CSE) 2025 Mock Test Series

Question Bank for GATE Computer Science Engineering

General Aptitude for GATE

Computer Networks

Programming and Data Structures

Top Courses for Computer Science Engineering (CSE)

View all

Assume that the algorithms considered here sort the input sequences in ascending order. If the input is already in ascending order, which of the following are TRUE ?I. Quicksort runs in Θ(n2) timeII. Bubblesort runs in Θ(n2) timeIII. Mergesort runs in Θ(n) timeIV. Insertion sort runs in Θ(n) timea)I and II onlyb)I and III onlyc)II and IV onlyd)I and IV onlyCorrect answer is option 'D'. Can you explain this answer?

Share with a Friend

Answer this doubt

Question Description
Assume that the algorithms considered here sort the input sequences in ascending order. If the input is already in ascending order, which of the following are TRUE ?I. Quicksort runs in Θ(n2) timeII. Bubblesort runs in Θ(n2) timeIII. Mergesort runs in Θ(n) timeIV. Insertion sort runs in Θ(n) timea)I and II onlyb)I and III onlyc)II and IV onlyd)I and IV onlyCorrect answer is option 'D'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Assume that the algorithms considered here sort the input sequences in ascending order. If the input is already in ascending order, which of the following are TRUE ?I. Quicksort runs in Θ(n2) timeII. Bubblesort runs in Θ(n2) timeIII. Mergesort runs in Θ(n) timeIV. Insertion sort runs in Θ(n) timea)I and II onlyb)I and III onlyc)II and IV onlyd)I and IV onlyCorrect answer is option 'D'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Assume that the algorithms considered here sort the input sequences in ascending order. If the input is already in ascending order, which of the following are TRUE ?I. Quicksort runs in Θ(n2) timeII. Bubblesort runs in Θ(n2) timeIII. Mergesort runs in Θ(n) timeIV. Insertion sort runs in Θ(n) timea)I and II onlyb)I and III onlyc)II and IV onlyd)I and IV onlyCorrect answer is option 'D'. Can you explain this answer?.

Solutions for Assume that the algorithms considered here sort the input sequences in ascending order. If the input is already in ascending order, which of the following are TRUE ?I. Quicksort runs in Θ(n2) timeII. Bubblesort runs in Θ(n2) timeIII. Mergesort runs in Θ(n) timeIV. Insertion sort runs in Θ(n) timea)I and II onlyb)I and III onlyc)II and IV onlyd)I and IV onlyCorrect answer is option 'D'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE). Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.

Here you can find the meaning of Assume that the algorithms considered here sort the input sequences in ascending order. If the input is already in ascending order, which of the following are TRUE ?I. Quicksort runs in Θ(n2) timeII. Bubblesort runs in Θ(n2) timeIII. Mergesort runs in Θ(n) timeIV. Insertion sort runs in Θ(n) timea)I and II onlyb)I and III onlyc)II and IV onlyd)I and IV onlyCorrect answer is option 'D'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of Assume that the algorithms considered here sort the input sequences in ascending order. If the input is already in ascending order, which of the following are TRUE ?I. Quicksort runs in Θ(n2) timeII. Bubblesort runs in Θ(n2) timeIII. Mergesort runs in Θ(n) timeIV. Insertion sort runs in Θ(n) timea)I and II onlyb)I and III onlyc)II and IV onlyd)I and IV onlyCorrect answer is option 'D'. Can you explain this answer?, a detailed solution for Assume that the algorithms considered here sort the input sequences in ascending order. If the input is already in ascending order, which of the following are TRUE ?I. Quicksort runs in Θ(n2) timeII. Bubblesort runs in Θ(n2) timeIII. Mergesort runs in Θ(n) timeIV. Insertion sort runs in Θ(n) timea)I and II onlyb)I and III onlyc)II and IV onlyd)I and IV onlyCorrect answer is option 'D'. Can you explain this answer? has been provided alongside types of Assume that the algorithms considered here sort the input sequences in ascending order. If the input is already in ascending order, which of the following are TRUE ?I. Quicksort runs in Θ(n2) timeII. Bubblesort runs in Θ(n2) timeIII. Mergesort runs in Θ(n) timeIV. Insertion sort runs in Θ(n) timea)I and II onlyb)I and III onlyc)II and IV onlyd)I and IV onlyCorrect answer is option 'D'. Can you explain this answer? theory, EduRev gives you an ample number of questions to practice Assume that the algorithms considered here sort the input sequences in ascending order. If the input is already in ascending order, which of the following are TRUE ?I. Quicksort runs in Θ(n2) timeII. Bubblesort runs in Θ(n2) timeIII. Mergesort runs in Θ(n) timeIV. Insertion sort runs in Θ(n) timea)I and II onlyb)I and III onlyc)II and IV onlyd)I and IV onlyCorrect answer is option 'D'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.

Explore Courses for Computer Science Engineering (CSE) exam