ALLInterview.com :: Home Page KalAajKal.com
 Advertise your Business Here     
Browse  |   Placement Papers  |   Company  |   Code Snippets  |   Certifications  |   Visa Questions
Post Question  |   Post Answer  |   My Panel  |   Search  |   Articles  |   Topics  |   ERRORS new
   Refer this Site  Refer This Site to Your Friends  Site Map  Bookmark this Site  Set it as your HomePage  Contact Us     Login  |  Sign Up                      
info       Did you received any Funny E-Mails from your Friends and like to share with rest of our friends? Yeah!! you can post that stuff   HERE
Google
 
Categories  >>  Software  >>  Operating Systems  >>  Data Structures
 
 


 

 
 Windows interview questions  Windows Interview Questions
 Linux interview questions  Linux Interview Questions
 Unix interview questions  Unix Interview Questions
 Solaris interview questions  Solaris Interview Questions
 RTOS interview questions  RTOS Interview Questions
 Bulnex interview questions  Bulnex Interview Questions
 Operating Systems General Concepts interview questions  Operating Systems General Concepts Interview Questions
 Data Structures interview questions  Data Structures Interview Questions
 Operating Systems AllOther interview questions  Operating Systems AllOther Interview Questions
Question 
A list is ordered from smaller to largest when a sort is
called. Which sort would take the longest time to execute?
 Question Submitted By :: Guest
I also faced this Question!!     Rank Answer Posted By  
 
  Re: A list is ordered from smaller to largest when a sort is called. Which sort would take the longest time to execute?
Answer
# 1		 
I am not sure about the answer.

But I think the answer is "Selection Sort" whose order is
O(n^2) irrespective of the elements order.

I guess all other sorts somehow depend on the order of elements.
 
Is This Answer Correct ?    0 Yes 1 No
Ntrphanikumar
 
  Re: A list is ordered from smaller to largest when a sort is called. Which sort would take the longest time to execute?
Answer
# 2		 
Its Quick Sort !!!!!
Even I got Surpriced!!!


http://www.geocities.com/siliconvalley/network/1854/Sort1.
html
 
Is This Answer Correct ?    1 Yes 0 No
Udkl
 
 
 
  Re: A list is ordered from smaller to largest when a sort is called. Which sort would take the longest time to execute?
Answer
# 3		 
selection sort.
 
Is This Answer Correct ?    0 Yes 1 No
Punit
 
  Re: A list is ordered from smaller to largest when a sort is called. Which sort would take the longest time to execute?
Answer
# 4		 
selection sort,quick sort,bubble sort 
(all will take the same time and its time complexity is of 
the order of n^2)
the time complexity for insertion sort when the list is 
ordered from smaller to larger is O(n)
the time complexity for merge sort irrespective of the 
order of the elements is O(nlogn)
 
Is This Answer Correct ?    1 Yes 0 No
Uma Sankar Pradhan
 

 
 
 
Other Data Structures Interview Questions
 
  Question Asked @ Answers
 
The element being searched for is not found in an array of 100 elements. What is the average number of comparisons needed in a sequential search to determine that the element is not there, if the elements are completely unordered? Morgan-Stanley7
Write a Binary Search program  2
Write the programs for Linked List (Insertion and Deletion) operations  1
Which data structure is needed to convert infix notations to post fix notations? Fidelity8
How is it possible to insert different type of elements in stack?  5
A list is ordered from smaller to largest when a sort is called. Which sort would take the longest time to execute?  4
What is the average number of comparisons needed in a sequential search to determine the position of an element in an array of 100 elements, if the elements are ordered from largest to smallest? ABB10
Which sort show the best average behavior?  6
Convert the following infix expression to post fix notation ((a+2)*(b+4)) -1  7
In which data structure, elements can be added or removed at either end, but not in the middle? Wipro19
What is the maximum total number of nodes in a tree that has N levels? Note that the root is level (zero) Sasken10
Explain about the types of linked lists  4
Evaluate the following prefix expression " ++ 26 + - 1324" Patni8
How would you sort a linked list?  3
How many different binary trees and binary search trees can be made from three nodes that contain the key values 1, 2 & 3? iGate9
Explain binary searching, Fibinocci search. IBM1
Write programs for Bubble Sort, Quick sort  2
sir plz. send me a bunch of questions related to this topic which may help me in campus selection ABC1
What is B+ tree? BMC3
Which one is faster? A binary search of an orderd set of elements in an array or a sequential search of the elements. Syntel9
 
For more Data Structures Interview Questions Click Here 
 
 
 
 
 
   
Copyright Policy  |  Terms of Service  |  Help  |  Site Map 1  |  Articles  |  Site Map  |   Site Map  |  Contact Us |   interview questions urls   External Links 
   
Copyright © 2007  ALLInterview.com.  All Rights Reserved.

ALLInterview.com   ::  Forum9.com   ::  KalAajKal.com