DS basic

12345678910111213
Across
  1. 2. Deletion from one end and insertion from other end
  2. 4. Used in quicksort for comparision
  3. 7. Defines the scope and life of variable
  4. 11. Store the non-homogeneous data elements
  5. 12. Main measure for the efficiency of an algorithm
  6. 13. Used in Recursive problems
Down
  1. 1. Sorts using Divide and conquer strategy
  2. 3. Notations used in Evaluation of Arithmetic Expressions
  3. 5. Operation of processing each element in the list
  4. 6. Memory address of the first element of an array
  5. 8. Highest precedence operator
  6. 9. Two dimensional arrays
  7. 10. Sort which compares adjacent elements in a list and switches where necessary