Merge sort , Data Structure & Algorithms

What is the best-case number of comparisons performed by mergesort on an input sequence of 2k distinct numbers?

Posted Date: 2/16/2013 2:48:58 AM | Location : United States







Related Discussions:- Merge sort , Assignment Help, Ask Question on Merge sort , Get Answer, Expert's Help, Merge sort Discussions

Write discussion on Merge sort
Your posts are moderated
Related Questions
write a algorithsm in c to perform push and pop operations stastic implementation using array ?

write an algorithm to sort given numbers in ascending order using bubble sort

Q. Convert the following given Infix expression to Postfix form using the stack function: x + y * z + ( p * q + r ) * s , Follow general precedence rule and suppose tha

Q. Write an algorithm INSERT which takes a pointer to a sorted list and a pointer to a node and inserts the node into its correct position or place in the list.  Ans: /* s

List various problem solving techniques. There are two techniques:- 1.  Top down 2.  Bottom- up

Write the algorithm for compound interest

For the following graph find the adjacency matrix and adjacency list representation of the graph.

Q. The given values are to be stored in a hash table 25, 42, 96, 101, 102, 162, 197 Explain how the values are hashed by using division technique of hashing with a table

Explain about the Abstract data type Abstract data type (ADT) A set of values (the carrier set) and operations on those values

The most common way to insert nodes to a general tree is to first discover the desired parent of the node you desire to insert, and then insert the node to the parent's child list.