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

Across

1. Algorithm that repeatedly compares adjacent items in a list or array and swaps them until everything is sorted.

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

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

4. 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.

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

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

7. The process of exchanging two items in a list or array.

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

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

10. The number of times two elements are compared during the sorting process.

Down

11. Algorithm that searches a sorted list or array by repeatedly dividing in half until the desired item is found.

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

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

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

15. An individual item in a list or array.

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

17. The central component of the merge sort algorithm is the function that combines two sorted subarrays. Its primary goal is to merge these arrays.

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

🖶