CMP4010 Computational Thinking - Week 2

These flashcards cover key concepts from the CMP4010 Computational Thinking lectures, focusing on algorithms, recursion, and problem-solving techniques.

Divide and Conquer Algorithm

A problem-solving technique used to solve problems by dividing the main problem into subproblems, solving them individually, and then merging them.

Recursion

A technique where a function calls itself to solve a problem, particularly useful for problems that can be divided into smaller, similar problems.

Decomposition

The process of breaking down a complex problem into smaller, more manageable subproblems.

Pattern Recognition

Identifying common trends or similarities among problems in computational thinking.

Abstraction

Hiding details of the implementation to focus on the high-level structure of a problem.

Algorithmic Thinking

A systematic approach to problem solving that uses algorithms to create solutions.

Merge Sort

A divide and conquer algorithm that divides an array into halves, sorts each half, and then merges the sorted halves.

Sorting

The process of arranging elements in a particular order, such as ascending or descending.

Merging

Combining two or more sorted files into a third sorted file.

Factorial Calculation

The product of all positive integers up to a number N, denoted as N!.

Literature Review

A comprehensive overview of existing research and findings related to a specific topic.