GeekInterview.com
  I am new, Sign me up!
 
GeekInterview.com  >  Placement Papers  >  Hughes  >  Technical
Go To First  |  Previous Question  |  Next Question 
 Technical  |  Question 15 of 41    Print  
Suggest a sorting algorithm, which is efficient (in worst case) to 10 values

A. Binary tree
B. Selection
C. Bubble
D. Any of the above


  
Total Answers and Comments: 2 Last Update: September 28, 2005   
  
 Sponsored Links

 
 Best Rated Answer

No best answer available. Please pick the good answer available or submit your answer.
August 15, 2005 01:31:29   #1  
Amit Dhamija        

RE: Suggest a sorting algorithm, which is efficient (in worst case) to 10 valuesA. Binary treeB. Selecti...
B.selection
 
Is this answer useful? Yes | No
September 28, 2005 18:57:46   #2  
sameergupta Member Since: September 2005   Contribution: 6    

RE: Suggest a sorting algorithm, which is efficient (i...
Binary tree will be the most efficient algorithm in the worst case with O(n) n ln n
 
Is this answer useful? Yes | No

 Related Questions

Suggest a sorting algorithm, which is efficient (in worst case) to 10 valuesA. Binary treeB. SelectionC. BubbleD. Any of the above

What is the number of comparisons in the worst case to merge two sorted lists containing n elements each?A. 2nB. 2n-1C. 2n+1D. 2n-2

If a binary tree is constructed using nodes with two pointers each,how many null pointers does a tree with N nodes have?A. n-1B. nC. n+1D. Depends on the number of edges

For the following C programvoid insert(key,r)typekey key,data array r;{extern int n;if(n>=max) /*error table if full */else r[n++].k=key;}This on executing, enables aA. Basic sequential searchB. Binary searchC. Interpolation searchD. None

Latest Answer : 101001.1011 ...


 Sponsored Links

 
Related Articles

Tree Topology

Tree Topology Among all the Network Topologies we can derive that the Tree Topology is a combination of the bus and the Star Topology The tree like structure allows you to have many servers on the network and you can branch out the network in many ways This is particularly helpful for colleges unive
 

jQuery Completed sorting and paging code

Learning jQuery The Finished Code The completed sorting and paging code in its entirety follows mosgoogle geshibot lang php" fn alternateRowColors function tbody tr odd this removeClass even addClass odd ; tbody tr even this removeClass odd addClass even ; return this; ; document
 

jQuery - Sorting Other Types of Data

Learning jQuery Sorting Other Types of Data Our sort routine should be able to handle not just the Title and Author columns but the Publish Dates and Price as well Since we streamlined our comparator function it can handle all kinds of data but the computed keys will need to be adjusted for other da
 

jQuery - Basic Alphabetical Sorting

Learning jQuery Basic Alphabetical Sorting Now let s perform a sort on the Title column of the table We ll need a class on the table header cell so that we can select it properly geshibot lang html" Title Author s Publish Date Price geshibot mosgoogle To perform the actual s
 

jQuery - JavaScript Sorting

Learning jQuery JavaScript Sorting There are times though when we either don t want to wait for server responses when sorting or don t have a server side scripting language available to us A viable alternative in this case is to perform the sorting entirely on the browser using JavaScript client sid
 

jQuery Sorting

Learning jQuery Sorting In this chapter we will use jQuery to apply techniques for increasing the readability usability and visual appeal of tables though we are not dealing with tables used for layout and design In fact as the web standards movement has become more pervasive in the last few years t
 

What is B-Tree

B-Tree is an indexing technique most commonly used in databases and file systems where pointers to data are placed in a balance tree structure so that all references to any data can be accessed in an equal time frame. It is also a tree data structure which keeps data sorted so that searching, insert
 

Assign values during declaration

How to assign values during declaration of variables Declaring variables tells the compiler the data type the variable is assigned and no storage area is allocated during this stage. It is possible to assign values during declaration itself. For example, consider the following program: main() {
 

Data Warehouses Non Technical Issues

Data Warehouses Non Technical Issues When companies get ready to implement a data warehouse few of them pay attention to the political issues that may surround it It must be emphasized that politics can reduce the chances for success with a data warehouse project and I want to warn companies against
 

UML Elements : Use Case Diagram

UML Elements Use Case Diagram In the Unified Modeling Language a use case diagram is a subset of the behavior diagrams The Unified Modeling Language will utilize the use case diagram as a graphical system which symbolizes use cases mosgoogle center It must be noted that UML will not define the stand
 

Related Categories
Sponsored Links

 
About Us -  Privacy Policy -  Terms and Conditions -  Contact -  Ask Question -  Propose Category -  Site Updates 

Copyright © 2005 - 2009 GeekInterview.com. All Rights Reserved

Page copy protected against web site content infringement by Copyscape