1/2					14															18
																17
	12										15			16
	3
																		4
					5
			6
7			13
							8
						9
		10
									11

Across

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

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

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

4. It is the length of the longest path from a node to a leaf in a binary search tree.

5. The number of times two elements are swapped during the sorting process.

6. The time taken to execute an algorithm or program.

7. A method for solving a problem by dividing it into progressively smaller subproblems.

8. Algorithm that divides an array into sub-lists, sorts the sub-lists, and then merges them back together in sorted order.

9. A sort algorithm that looks at the elements of the array to be sorted to determine their relative order.

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

11. A measure of how much time and/or space is required to execute an algorithm or program.

Down

12. It is the range of elements in which the binary search algorithm looks for the target element.

13. A list that is not sorted according to any specific criterion.

14. The process of checking two items and determining which one is greater or smaller than the other.

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

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

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

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

🖶