Navigate

Question Detail

The complexity of Bubble sort algorithm is

  • O(n)
  • O(log n)
  • O(n2)
  • O(n log n)

Answer: Option C

Similar Questions :

1. Which is having highest precedence in C

  • relational operators
  • equality operator
  • logical operator
  • arithmetic operator

Answer: Option D

2. The memory address of the first element of an array is called

  • floor address
  • first address
  • foundation address
  • base address

Answer: Option D

3. Recursive problems are implemented by

  • queues
  • stacks
  • linked lists
  • strings

Answer: Option B

4. Sort which compares adjacent elements in a list and switches where necessary is

  • Insertion sort
  • Heap sort
  • Quick sort
  • Bubble sort

Answer: Option D

5. ++i is equivalent to

  • i = i + 2
  • i = i + 1
  • i = i + i
  • i = i - 1

Answer: Option B

Read more from - Data Structure Questions Answers - Chapter 1