Across
- 4. SORT : Sorting algorithm where the smallest element is selected at each stage, structuring a perfect tournament
- 5. ALGORITHM : Scheduling algorithm that optimizes memory allocation for tasks that start and end at different times
- 8. MATRIX : Matrix where most elements are zero, stored efficiently by keeping only non-zero elements
- 10. SEARCH : Search algorithm that behaves like an explorer halving unexplored regions to find treasure in an ordered desert
- 12. SORT : Sorting algorithm best suited for sorting integers with a small range compared to the number of elements
- 14. EVALUATION : Evaluating expressions where operators follow their operands
- 15. : Act of putting things in order, like organizing a wardrobe by color or season
Down
- 1. LINKED LIST : Linked list where the last node points back to the first, allowing endless traversal
- 2. : Data structure used to ensure navigation back to any previously visited location, like exploring a city
- 3. : Operation in a priority queue where the highest-priority element is accessed and removed
- 6. : Data structure used to represent polynomials in a Generalized Linked List (GLL)
- 7. SEARCH : Search algorithm with time complexity of O(log log n) when applied to a Fibonacci series-sorted array
- 9. : Data structure used to convert infix expressions to postfix
- 11. SORT : Sorting algorithm with best-case time complexity of O(n) when input is already sorted
- 13. SEARCH (ARRAY) : Algorithm that divides a sorted array, like finding 6 in the array [1, 2, 3, 4, 5, 6, 7, 8]