Logic and Algorithms

Graph is a branch of mathematics that can be applied in everyday life, graph theory can solve many existing problems (Ramadhan et al., 2018).

Greedy is taken from English meaning greedy, avaricious, stingy, miserly.

Techniques for picking and selecting an element from several existing elements.

The process of arranging a series of data into a certain order or arrangement. The sorted data can be numeric data, character data, or string data (Sitorus, 2015).

The Divide and Conquer method is a problem-solving approach that divides a problem into smaller parts, solves each part, and then combines the results.

An array is a data structure used to store multiple values in a single variable.

A recursive structure is a concept where a function calls itself to solve a problem.

Looping is a control structure that allows a program to repeat the execution of a block of code as long as a certain condition is met.

Branching is a control structure that allows a program to make decisions based on certain conditions.

A flowchart is a graphical representation of an algorithm that uses symbols to show the steps in problem-solving.

The Concept of Algorithm is an effort with a sequence of operations arranged logically and systematically to solve a problem to produce a specific output, while Data Type is an attribute related to data that will tell the computer system.

A complete tutorial on logic and algorithms for beginners that will help you understand the basics of logic and algorithms as well as how to create problem solutions.