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

Across

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

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

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

4. A collection of elements of the same data type, stored in contiguous memory locations.

5. A variant of merge sort that does not require extra space for temporary arrays or data structures.

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

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

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

9. It is the element being searched for in the binary search algorithm.

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

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

Down

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

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

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

15. A mathematical notation used to describe the time complexity of an algorithm.

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

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

🖶