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

31. Mergesort makes two recursive calls. Which statement is true after these recursive calls finish, but before the merge step ?

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

32. The worst-case time for binary search to find out a
single item in an array is in _________________ ?

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

33. In selecting the pivot for quicksort, the best choice
for optimal partitioning is: ?

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

34. A newspaper route has recently been computerized. Information about each of the 100 customers is stored in individual records containing first name, last name, and payment due. In writing a computer program to process the customer records, the programmer is uncertain whether to add a procedure to sort the records.If the records are first sorted, what will be the maximum number of comparisons needed with a binary search to find a
particular customer's record? ?

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

35. It is not a good idea to use binary search to find a value in a sorted linked list of values. Why?

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

36. Linear Search is best for ... ?

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

38. The time complexity of insertion sort in worst case is?

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

39. Let S and S1 be two stacks and Q be the additional Queue then what is the result puted:

while (S not empty)
{
Q.insert(pop(S));
}

while(Q not empty)
{
push(S1,Q.delete());
} ?

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

40. Assume that you have a very large array of elements. You are required to sort the space rather than time. Which among the following algorithm is not an ideal

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!