merge sort time complexity
Answer Posted / ashfaque
Its correct in every cases , may be average, worst or best..
The time complexity is always O(n log n)
| Is This Answer Correct ? | 34 Yes | 8 No |
Post New Answer View All Answers
we create a pf with 3 fields.2 is defined as keyfields.we lock it with alcobj command.how we find out whether the file is locked or not?is it dspfd??/
what is meant by life cycle of a business
Difference between debugging, running, executing of an application
in teradata level primary in table level allows duplicates why?
Given an array of size n+1 which contains all the numbers from 1 to n.Find the number which is repeated in O(n) time.How do you proceed with the same with floating numbers from 0 to 1 instead of 1 to n?
What binary value will be internally stored for NULL for the type S9(1) COMP 3 in mainframe
Tips for blog integration by www.esteemwebsolutions.com. Can Any body suggest me to how to make wonderful questions on web integration..
Difference between views and index in sas programming
Explain polymorphism. Provide an example.
Given a Binary Search Tree, write a program to print the kth smallest element without using any static/global variable. You can?t pass the value k to any function also.
what are stubs related to foxpro?
if 2 is passed as an argument to the method,void GC.Collect then what would be the result?
write the a cl program with the following specification A. Accept 2 parameters-date and date type B. if date type is J then convert date to *MDY format C. if date type is M convert date to *JUL format 4.send a program message with the value of converted date Please explain for each with coding?
You are given a dictionary of all valid words. You have the following 3 operations permitted on a word: delete a character, insert a character, replace a character. Now given two words - word1 and word2 - find the minimum number of steps required to convert word1 to word2. (one operation counts as 1 step.)
3. What is the difference between testing and Quality Assurance?