Note 1
Take Note:

Take a note while surfing.

Note With Ink

Give your Note a Colorful Tag.

Easy to Access

Stay on same information and in Sync wherever you are.

Note 2
Take Note:

Organize your information,It may take Shape.

Easy to Access

Easy to pull up your content from anywhere anytime.

Note 3
Take Note:

Don't Let information to miss,Because it take shape

Note With Ink

Simple an Easy Way to take a note.

Easy to Access

Get the same in next visit.

Data Structures :: Searching & Sorting

Home > Data Structures > Searching & Sorting > General Questions

21. Consider that n elements are to be sorted. What is the worst case time complexity of Bubble sort?

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

22. A characteristic of the data that binary search uses but the linear search ignores is the___________.

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

23. In order to get the contents of a Binary search tree in ascending order, one has to traverse it in

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

24. Which of the following sorting algorithm is stable

Explanation:

Insertion and bubble both are stable

Workspace

Tags:  No Tags on this question yet!

25. In binary search, average number of comparison required for searching an element in a list if n numbers is

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

26. In order to get the information stored in a Binary Search Tree in the descending order, one should traverse it in which of the following order?

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

27. For an array containing 5 elements as : 42 29 75 11
65 58 60 18 what will be the result of sorting in
ascending order using bubble sort after 2 passes
have completed. ?

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

28. The number of interchanges required to sort 5, 1, 6, 2 4 in ascending order using Bubble Sort is:

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

29. Which of the following sorting algorithms does not have a worst case running time of O(n^2) ?

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

30. Consider the following set of integers.
{20,25,57,48,37,12,92,86,33}
If one uses the quick sort algorithm to sort the above set of integers, how many p to completely sort the file?
Note: you may choose middle element as a pivot?

Explanation:

Anyone plz explain this.

Workspace

Tags:  No Tags on this question yet!