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

Across

1. A sorting algorithm that necessitates extra memory in order to arrange the array.

2. The ability to identify similarities or commonalities among different problems or situations.

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

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. A sort algorithm that arranges the elements of an array without needing any extra memory for sorting.

6. The bundling of data and methods that operate on that data within a single unit.

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

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

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

10. A mathematical notation used to describe the upper bound of the time complexity of an algorithm as the input size approaches infinity.

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

Down

12. A modular, reusable, and self-contained part of a larger system.

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

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

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

16. The technique of simplifying intricate data by offering a high-level interface.

17. A measure of how well an algorithm solves a problem, often in terms of time and computational resources required.

🖶