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

Across

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

2. The time or space complexity of an algorithm when it receives the worst input possible.

3. A sorting algorithm that does not require extra space for temporary arrays or data structures.

4. Solving a problem by breaking it down into smaller subproblems and solving them independently.

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

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

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

8. A symbol used in a flowchart to indicate an output or data display point within an algorithm.

9. A symbol used in a flowchart to indicate a repetitive action in an algorithm.

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

11. A measure of time complexity in which the execution time increases linearly with the size of the input.

Down

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

13. An operation whose execution time remains unchanged regardless of input size.

14. The ability to use existing code in multiple programs or contexts.

15. The number of times two elements are swapped during the sorting process.

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

17. An algorithm which puts elements in a list or array in a specific order.

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

🖶