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

Across

1. It is a data structure that allows fast searching, insertion and deletion of elements, using the binary search algorithm on a sorted tree.

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

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

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

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

6. A sorting algorithm that rearranges the original array without using additional memory.

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

8. The amount of memory an algorithm requires to solve a problem as a function of the size of the input.

9. The time or space complexity of an algorithm when it receives the best input possible.

10. The process of repeating a set of instructions until a specific condition is met or a particular outcome is achieved.

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

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

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

Down

14. A sorting algorithm that keeps the original order of elements with equal values.

15. An individual item in a list or array.

16. The scenario in which an algorithm takes the longest time to complete.

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

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

🖶