- World's Largest Collection of Interview Questions
Start Your Own website Now
Sponsored Links

Interview Questions
Our Services

Get 9,000 Interview Questions & Answers in an eBook.

  • 9500+ Pages
  • 9000 Question & Answers
  • All Tech. Categories
  • 14 MB Content

    Get it now !!

    Send your Resume to 6000 Companies

    Question :
    What is the bubble short ?

    Posted by: Tejendra yadav on 2/13/2011

    Contact Tejendra yadav Contact Tejendra yadav
    Category Data Structure Interview Questions
    Rating (0.3) By 1027 users
    Added on 2/13/2011
    Views 493
    Rate it!

    Yes Bubble sort is the least efficient algorithm available.
    However, for small data sets it doesnt matter much what sorting algorithm u use. And bubble sort does have a few good qualities. Apart from being the simplest and the easiest of the sorting algorithms it knows when the data set is already sorted(just a slight modification) making it ideal for sorted or nearly sorted data items(along with insertion sort).

    Posted by: Narendra     

    Contact Narendra Contact Narendra

    in bubble sort one has to compare 1 st element with the second,then second element with the third and son will be better to use bubble sort if number of elements to be sorted are few.

    Posted by: vikram    

    Contact vikram Contact vikram

    Bubble sort is an sorting algorithm, where every element in the unsorted list, is compared with every other element to make a sorted list. All these comparisons add up to the overall time complexity of the algorithm to be O(n) if n is the input size, which is really high compared to other popular algorithms.

    Posted by: dhritiman Hazarika    

    Contact dhritiman Hazarika Contact dhritiman Hazarika

    Bubble sort is a simple sorting algorithm.It works by repeatedly stepping through the list to be sorted, comparing each pair of adjacent items and swapping them if they are wrong order.The pass through the list is repeaed until no swaps are needed,which indicates the list is sorted.

    Posted by: tanniru vani    

    Contact tanniru vani Contact tanniru vani

    If you have the better answer, then send it to us. We will display your answer after the approval.
    Rules to Post Answers in

  • There should not be any Spelling Mistakes.
  • There should not be any Gramatical Errors.
  • Answers must not contain any bad words.
  • Answers should not be the repeat of same answer, already approved.
  • Answer should be complete in itself.
  • Name :*
    Email Id :*
    Answer :*
    Verification Code Code Image - Please contact webmaster if you have problems seeing this image code Not readable? Load New Code
    Process Verification  Enter the above shown code:*
    Inform me about updated answers to this question

    Related Questions
    View Answer
    Suppose you have a sorted array of 250 elements. What is the maximum number of elements you
    have to examine to determine if some value v is in your array if you use an efficient search?
    a) 7 b) 8 c) 125 d) 250
    View Answer
    What is data structure?
    View Answer
    What is event, delegate & data structure?
    View Answer
    How to concatenate two linked lists?
    View Answer
    How to concatenate the two linked lists?
    View Answer
    What exactly does this procedure BUBBLE_SORT (K, N) does?
    View Answer
    Define addressing and linear addressing functions?
    View Answer
    Given N discs of decreasing size stacked on one needle and two empty needles, it is required to stack all the discs onto a second needle in decreasing order of size. The third needle may be used as temporary storage.
    The movement of the discs is restricted by the following rules
    (1) A disc may be moved from any needle to any other
    (2) Only one disc may be moved at a time
    (3) At no time may a larger disc rest upon smaller disc explain the solution?
    View Answer
    Define Index area and its subdivisions?
    View Answer
    Define Simulation?
    View Answer
    What is the distant relationship between a list structure and a digraph?
    View Answer
    Name two desirable properties of hashing functions.
    View Answer
    What is a one way chain or singly linked linear list?
    View Answer
    What is splitting?
    View Answer
    What is linear hashing?
    View Answer
    What is a priority queue?
    View Answer
    State the theorem which is used to determine whether a given expression is valid or not.
    View Answer
    Explain the three applications in which stacks are used?
    View Answer
    Define and explain ?push? and ?pop??
    View Answer
    Define stack?
    View Answer

    Please Note: We keep on updating better answers to this site. In case you are looking for Jobs, Pls Click Here - Best Freshers & Experienced Jobs Website.

    View ALL Data Structure Interview Questions

    User Options
    Sponsored Links

    Copyright ©2003-2015, All Rights Reserved.
    Privacy Policy | Terms and Conditions

    Download Yahoo Messenger | Placement Papers| FREE SMS | ASP .Net Tutorial | Web Hosting | Dedicated Servers | C Interview Questions & Answers

    Testing Articles | Testing Books | Testing Certifications | Testing FAQs | Testing Downloads | Testing Interview Questions | Testing Jobs | Testing Training Institutes

    Cache = 0.0625 Seconds