The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort is ?
11
12
13
14
Also checkout these categories
Units, Dimensions and Errors MCQ Series MCQ Neuromuscular bladder dysfunctions MCQ Pipes and Cistern MCQ Rearrangement Set 9 MCQ Development of Biology MCQ Choosing the correct sentence MCQ Heat & Mass Transfer MCQ Nuclear Physics MCQ Rearrangement Set 14 MCQ Electricity Fundamentals MCQ Basics of Neurology MCQ
- The Average case occur in linear search algorithm
- Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…
- Arrays are best data structures
- The complexity of linear search algorithm is
- The complexity of merge sort algorithm is
- When determining the efficiency of algorithm the time factor is measured by
- Linked list are not suitable data structure of which one of the following problems ?
- _______ level is where the model becomes compatible executable code
- Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case…
- Which of the following data structure is linear data structure?
- Inserting an item into the stack when stack is not full is called _______ Operation and deletion of…
- The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a…
- Which of the following algorithm design technique is used in the quick sort algorithm?
- A variable P is called pointer if
- Which of the following is two way list?
- Which data structure is used in breadth first search of a graph to hold nodes?
- _____ is not the component of data structure.
- Stack is also called as
- The complexity of Bubble sort algorithm is
- Which of the following is not the part of ADT description?
- For an algorithm the complexity of the average case is
- When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
- Which of the following data structures are indexed structures?
- The term push and pop is related to the
- Two main measures for the efficiency of an algorithm are
- The complexity of Binary search algorithm is
- Which if the following is/are the levels of implementation of data structure
- Linked lists are best suited
- If the values of a variable in one module is indirectly changed by another module, this situation is…
- When determining the efficiency of algorithm, the space factor is measured by