Data Algorithms

Share this topic

Data Algorithms

From the book I Am Datapedia!, published here free by the author.

Part of I Am Datapedia!

To understand Data Algorithms, let's quickly know what an algorithm is. It is a procedure consisting of multiple steps with a set of instructions for a desired result. It is independent of any language, in other words, an algorithm can be implemented in any language.

Algorithm Characteristics

  • Unambiguous: It should be clear and unambiguous. Each of its steps, and its inputs/outputs should be clear and must lead to only one meaning.
  • Input: It should have 0 or more well-defined inputs.
  • Output: It should have 1 or more well-defined outputs and should match the desired output.
  • Finiteness: It must terminate after a finite number of steps.
  • Feasibility: It should be feasible with the available resources.
  • Independent: It should have step-by-step directions, which should be independent of any programming code.

Diagram

Description automatically generatedNow from a data point-of-view, how the algorithm behaves.

  • Search: Algorithm to search an item in a data structure.
  • Sort: Algorithm to sort items in a certain order.
  • Insert: Algorithm to insert an item in a data structure.
  • Update: Algorithm to update an existing item in a data structure.
  • Delete: Algorithm to delete an existing item from a data structure.

Express your reaction

Your Take on This Insight?

Share how this content resonates with you.

Comment
Useful0
Insightful0
Actionable0
Thought-provoking0
Inspiring0

0 reactionsSign in to react or comment

Comments (0)

No comments yet.

    Free account

    You can read every topic without one. A free account lets you react to this topic, comment under it and search the Knowledge Hub. Reacting and commenting need a confirmed e-mail address.