FDS

1234567891011121314
Across
  1. 3. Evaluating expressions where operators follow their operands
  2. 4. Data structure used to convert infix expressions to postfix
  3. 7. Data structure used to represent polynomials in a Generalized Linked List (GLL)
  4. 8. What is the precursor requirement for applying Binary Search on an array
  5. 10. Sorting algorithm best suited for sorting integers with a small range compared to the number of elements
  6. 11. Operation in a priority queue where the highest-priority element is accessed and removed
  7. 12. Linked list where the last node points back to the first, allowing endless traversal
  8. 13. Act of putting things in order, like organizing a wardrobe by color or season
  9. 14. Algorithm that divides a sorted array, like finding 6 in the array [1, 2, 3, 4, 5, 6, 7, 8]
Down
  1. 1. SORT Sorting algorithm with best-case time complexity of O(n) when input is already sorted
  2. 2. What is the term used for a dynamic data structure where memory is allocated at runtime
  3. 4. Matrix where most elements are zero, stored efficiently by keeping only non-zero elements
  4. 5. Search algorithm with time complexity of O(log log n) when applied to a Fibonacci series-sorted array
  5. 6. Sorting algorithm where the smallest element is selected at each stage, structuring a perfect tournament
  6. 9. What is the term for a function that calls itself