Home

The complexity of linear search algorithm is

A. O(n)

B. O(log n)

C. O(n2)

D. O(n log n)

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

You can do it
  1. _____ is not the component of data structure.
  2. Linked lists are best suited
  3. Which of the following name does not relate to stacks?
  4. The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort…
  5. Linked list are not suitable data structure of which one of the following problems ?
  6. Which of the following is not the required condition for binary search algorithm?
  7. Which of the following data structure is non linear type?
  8. Merge sort uses ?
  9. Which of the following data structure store the homogeneous data elements?
  10. The complexity of linear search algorithm is
  11. Which of the following is non-liner data structure?
  12. Which if the following is/are the levels of implementation of data structure
  13. The term push and pop is related to the
  14. Herder node is used as sentinel in ____
  15. Which of the following statement is false?
  16. Finding the location of the element with a given value is:
  17. ______ is very useful in situation when data have to stored and then retrieved in reverse order.
  18. ……………. Is a pile in which items are added at one end and removed from…
  19. Which of the following is not the part of ADT description?
  20. Which of the following statement is true ?
  21. Binary search algorithm can not be applied to
  22. For an algorithm the complexity of the average case is
  23. Which of the following data structure is not linear data structure?
  24. When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
  25. The memory address of the first element of an array is called
  26. Which of the following is not a limitation of binary search algorithm?
  27. Which of the following data structure cant store the non-homogeneous data elements?
  28. The operation of processing each element in the list is known as
  29. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…
  30. Each array declaration need not give, implicitly or explicitly, the information about