Fundamentals of Algorithms and Data Structures

📋 Course Outline

1. Algorithm Definition
2. Algorithm Expression
3. Program Concept
4. Complexity Notion
5. Search Algorithms
6. Sorting Algorithms
7. Data Structures
8. Stacks and Queues
9. Linked Lists
10. Trees and Binary Trees
11. Graph Representations
12. Hashing Techniques

📖 1. Algorithm Definition

🔑 Key Concepts & Definitions

• Algorithm: A finite sequence of elementary operations arranged in a specific order, which specifies a calculation scheme. According to the Encyclopedia Universalis, it is a schema of calculation expressed as a finite set of elementary operations obeying a determined sequence. (Source: Encyclopaedia Universalis)

• Algorithm as Data Transformation: An algorithm functions as a process that transforms input data into output results through a series of well-defined steps. It systematically processes data to achieve a certain goal. (Implied from the general definition)

• Deterministic Algorithm: An algorithm that, given the same input, always produces the same sequence of operations and results. This property ensures consistency and predictability in execution. (Source: Encyclopaedia Universalis)