Question Detail

The complexity of Bubble sort algorithm is

  • O(n)
  • O(log n)
  • O(n2)
  • O(n log n)
Similar Questions :

1. Information about an array used in a program will be stored in

  • symbol table
  • activation record
  • dope vector
  • system table

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

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

3. Recursive problems are implemented by

  • queues
  • stacks
  • linked lists
  • strings

4. Which is ALGOL based simulation language

  • FORTRAN
  • SIMSCRIPT
  • GASP IV
  • none of above

5. Which is problem oriented language

  • BASIC
  • PL/I
  • FORTRAN
  • none of above
Read more from - Data Structure Questions Answers - Chapter 1