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

Across

1. A step-by-step process for solving a problem or achieving a specific goal.

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

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

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

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

6. An individual item in a list or array.

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

8. A problem-solving strategy that involves breaking a problem into smaller sub-problems, solving them independently and combining their solutions.

9. The scenario in which an algorithm takes an average amount of time to solve a given problem.

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

11. The process of combining two or more sorted sub-arrays into a single sorted array.

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

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

Down

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

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

16. The process of finding a specific value within an array or list.

17. The amount of time it takes to complete a task as the input size increases.

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

19. Algorithm that searches for a specific element in a list or array by checking each element one at a time.

🖶