Home

The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort is ?

A. 11

B. 12

C. 13

D. 14

Please do not use chat terms. Example: avoid using "grt" instead of "great".

You can do it
  1. The Average case occur in linear search algorithm
  2. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…
  3. Arrays are best data structures
  4. The complexity of linear search algorithm is
  5. The complexity of merge sort algorithm is
  6. When determining the efficiency of algorithm the time factor is measured by
  7. Linked list are not suitable data structure of which one of the following problems ?
  8. _______ level is where the model becomes compatible executable code
  9. Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case…
  10. Which of the following data structure is linear data structure?
  11. Inserting an item into the stack when stack is not full is called _______ Operation and deletion of…
  12. The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a…
  13. Which of the following algorithm design technique is used in the quick sort algorithm?
  14. A variable P is called pointer if
  15. Which of the following is two way list?
  16. Which data structure is used in breadth first search of a graph to hold nodes?
  17. _____ is not the component of data structure.
  18. Stack is also called as
  19. The complexity of Bubble sort algorithm is
  20. Which of the following is not the part of ADT description?
  21. For an algorithm the complexity of the average case is
  22. When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
  23. Which of the following data structures are indexed structures?
  24. The term push and pop is related to the
  25. Two main measures for the efficiency of an algorithm are
  26. The complexity of Binary search algorithm is
  27. Which if the following is/are the levels of implementation of data structure
  28. Linked lists are best suited
  29. If the values of a variable in one module is indirectly changed by another module, this situation is…
  30. When determining the efficiency of algorithm, the space factor is measured by