Memoization or memoisation is an optimization technique used primarily to speed up computer programs by storing the results of expensive function calls and returning the cached result when the same inputs occur again.

Big Omega is the reverse Big O, if Big O is used to describe the upper bound (worst - case) of a asymptotic function, Big Omega is used to describe the lower bound (best-case).

A way of designing algorithm is called algorithmic strategy

The time efficiency of an algorithm is measured by different factors. For example, write a program for a defined algorithm, execute it by using any programming language, and measure the total time it takes to run.

(i) Time factor
(ii) Space factor

Analysis of algorithms and performance evaluation can be divided into two different phases:
(i) A Priori estimates: This is a theoretical performance analysis of an algorithm. Efficiency of an algorithm is measured by assuming the external factors.
(ii) A Posterori testing: This is called performance measurement. In this analysis, actual statistics like running time and required for the algorithm executions are collected.

Efficiency of an algorithm is defined by the utilization of time and space complexity

An algorithm that yields expected output for a valid input is called an algorithmic solution

(i) The way of defining an algorithm is called J algorithmic strategy.
(ii)  For example to calculate factorial for the given value n then it can be done by defining the function to calculate factorial once for the iteration-1 then it can be called recursively until the number of required iteration is reached.

Examples for data structures are arrays, structures, list, tuples, dictionary.

A searching algorithm is the step-by step procedure used to locate specific data among a collection of data. There are two types of searching are.
(i) Linear Search
(ii) Binary Search

Sorting is a method of arranging group of items in ascending or descending order. Various sorting techniques in algorithms are Bubble sort, Quick sort, Heap sort, Selection sort, Insertion sort.

Algorist may refer to,
1. A person skilled in the technique of performing basic decimal arithmetic, known as algorism.
2. A person skilled in the design of algorithms.
3. An algorithmic artist.

Pseudo code is an informal way of Programming language syntax.

An algorithm is a finite set of instructions to accomplish a particular task. It is a step-by-step procedure for solving a given problem.