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

Across

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

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

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

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

5. It is the point in the search interval that divides it into two equal halves.

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

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

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

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

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

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

Down

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

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

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

15. Algorithm that searches a list or array one item at a time in a linear fashion.

🖶