Algorithm and its properties


An algorithm is a finite collection of computing instructions that may be carried out in a certain amount of time to carry out computations or solve problems by taking inputs a value or set of values and producing outputs of a value or set of values.

Algorithms are really not dependent on a particular computer, programming language, or compilers; they operate in the same way everywhere. As a result, an algorithm is a mathematical object, and the algorithms are expected to run on machines with infinite capacity.

We require algorithms to comprehend the fundamental ideas of computer science, such as programming. To grasp the input-output relationship of the problem, we must be able to understand the procedures involved in obtaining output(s) from the provided input (s).

Properties of Algorithms

  1. Input(s)/output(s): Some inputs must come from the predefined set of inputs, and an algorithm’s execution must result in outputs (s).
  2. Definiteness: An algorithm’s steps must all be distinct and unambiguous.
  3. Finiteness: Algorithms must end after a set number of steps or of time.
  4. Correctness: Each set of inputs must result in the proper set of output values.
  5. Effectiveness: Each step must be completed in a set amount of time. Correctness and finiteness are the topics covered here.

DSA Articles: DSA

College Note for DAA:

Sudeep Mishra

Sudeep Mishra


%d bloggers like this: