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

Across

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

2. It is a data structure that allows fast searching, insertion and deletion of elements, using the binary search algorithm on a sorted tree.

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

4. The amount of memory or storage space required by an algorithm to solve a problem.

5. starting with small details and gradually building up to a complete understanding.

6. A sort algorithm that arranges the elements of an array without needing any extra memory for sorting.

7. A series of actions or steps taken in order to achieve a particular end.

8. A blueprint for creating objects that encapsulates data and behavior.

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

10. The ability to present the same interface for different underlying data types.

11. A symbol used in a flowchart to indicate an action taken in an algorithm.

Down

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

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

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

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

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

17. A measure of how much time and/or space is required to execute an algorithm or program.

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

19. A problem-solving strategy that involves breaking a problem into smaller sub-problems, solving them independently and combining their solutions.

🖶