1	12
																					15
2																			14
	3
	4
	5		13
		6
11		7
			8
		9
10

Across

1. It is a traversing method for binary search trees where the left and right subtrees are first recursively traversed, followed by the root.

2. A mathematical notation used to describe the upper bound of the time complexity of an algorithm as the input size approaches infinity.

3. A sorting algorithm that does not require extra space for temporary arrays or data structures.

4. The time or space complexity of an algorithm when it receives average inputs.

5. A sorting algorithm that necessitates extra memory in order to arrange the array.

6. The scenario in which an algorithm takes the shortest time to complete.

7. It is an array where the elements are arranged in increasing order.

8. An informal high-level description of the operating principle of a computer program is a non-specific outline that summarizes how the program functions.

9. A sorting order in which the items are arranged from largest to smallest.

10. The speed and effectiveness with which a task is completed, measured in terms of time and resources used.

Down

11. A sort algorithm that arranges the elements of an array without needing any extra memory for sorting.

12. The process of improving the performance of an algorithm by reducing its time or space complexity.

13. The amount of time an algorithm takes to solve a problem as a function of the size of the input.

14. The scenario in which an algorithm's execution time falls between the best-case and worst-case scenarios.

15. The time or space complexity of an algorithm when it receives the worst input possible.

🖶