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

Across

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

2. A set of rules used to encipher and decipher messages in a secure way.

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

4. The amount of memory used by an algorithm as the input size increases.

5. A control structure that enables a program to execute blocks of code depending on certain conditions.

6. Software used to create and edit flowcharts.

7. A data type that specifies only the functionality and not the specific way it is implemented.

8. Basic components of digital circuits that perform logical operations

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

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

Down

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

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

13. How easily the code can be understood by humans.

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.

🖶