Data Structure: Sorting - Online Test

Test Difficulty Level: Medium

Sorting: Questions based on the Sorting.

Question: The best sorting methods if no of swappings done, is the only measure of efficiency is

Option A: Bubble sort

Option B: Selection sort

Option C: Insertion sort

Option D: Heap sort

To answer, click the "Start This Test" button below.

	amina khatun on 2011-01-30 02:32:06 wrote, pl explain answer of question 15 and 16
	nikhil verma on 2011-02-17 09:39:19 wrote, NIKHIL---i can explain ,let question 15---quick sort takes n(logn) time,for 1000 name,it will do 1000(log1000)=9000 comparisions,so 9000 comparisions in 100 sec ,so 100 names(100(log100)=600 comparisions) will take---- 100*600/9000=6.7 sec. like this u can solve for question 16.
	debabrata SahaChowdhury on 2011-05-28 09:17:20 wrote, good questions.....
	shekhar jha on 2011-06-24 12:57:21 wrote, Question 20 : For merging two sorted lists of sizes m an into a sorted list of size m+n, we require comparisons of O(m) O(n) O(m+d) O(logn+log hope option c will o(m+n)
	Soniya Pawar on 2011-08-02 04:35:16 wrote, Good Questions..