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

Across

1. A sorting algorithm that preserves the relative order of equal elements in the sorted output.

2. starting with small details and gradually building up to a complete understanding.

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

4. The scenario in which an algorithm takes the most amount of time to solve a given problem.

5. A function or algorithm that calls itself with a smaller version of the problem until a base case is reached.

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

7. A variant of merge sort that does not require extra space for temporary arrays or data structures.

8. The process of repeating a set of instructions until a specific condition is met.

9. How easily the code can be understood by humans.

Down

10. An algorithm which searches for a specific element in a list or array.

11. A collection of elements of the same data type, stored in contiguous memory locations.

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

13. A blueprint for creating objects that encapsulates data and behavior.

14. A visual representation of an algorithm using shapes and arrows to show the flow of instructions.

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

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

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

18. It is a traversing method for binary search trees where the left subtree is recursively traversed, followed by the root, and then the right subtree.

🖶