The number of comparisons done by sequential search is ………………

Related Questions

• In general, the binary search method needs no more than ……………. comparisons.
• The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.
• The total number of comparisons in a bubble sort is ….
• A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……
• Which data structure is used in breadth first search of a graph to hold nodes?
• In ……………, search start at the beginning of the list and check every element in the list.
• How do you count the number of elements in the circular linked list?
• The total number of elements in a stack at a given point of time can be calculated from the value of______.
• Minimum number of fields in each node of a doubly linked list is____
• The number of edges in a complete graph of n vertices is