Properties of an Algorithm

Understanding Algorithm Properties - Data Structures Blog

An Algorithm is considered a well-defined set of instructions to solve any problem. A good Algorithm must have these 5 essential properties:

1. Finiteness

  • What does it mean? The Algorithm should stop after a limited number of steps. It should not get stuck in an infinite loop.
  • In simple terms: No matter what the input is, the Algorithm should finish its work and give a result. It should not run forever.

2. Definiteness

  • What does it mean? Every step of the Algorithm should be defined clearly and unambiguously.
  • In simple terms: Every instruction should be so clear that the person performing it does not have to think, "What should I do now?" Every operation should be precise.

3. Input

  • What does it mean? The Algorithm should be given zero or more external quantities, which are called Input.
  • In simple terms: The Algorithm needs some starting data or initial conditions to start its work. For example, if you are creating an Algorithm to add two numbers, those two numbers will be the Input.

4. Output

  • What does it mean? The Algorithm should produce at least one quantity, which is called Output.
  • In simple terms: The main purpose of the Algorithm is to solve the problem. The result obtained as a solution is called Output. There is no point in creating an Algorithm without Output.

5. Effectiveness

  • What does it mean? Every operation of the Algorithm should be fundamentally basic so that it can be effectively done with a pencil and paper in principle.
  • In simple terms: The instructions of the Algorithm should be such that they can be easily and reliably executed. There should be no impossible or unspecified operations in it.

Additional Property

Efficiency

  • What does it mean? An Algorithm should be efficient, meaning it should use minimum time and minimum memory space.
  • In simple terms: If you have two different Algorithms to do the same task, you will choose the one that is faster and uses fewer resources.

© 2023 Data Structures Insights. All rights reserved.

Comments

Post a Comment

Popular posts from this blog

Data Abstraction

Image
What is Data Abstraction? Data Abstraction ka matlab hota hai: “Sirf zaruri cheez dikhana, aur jo andar ki complex working hai usse chhupa dena.” Programming me hum user ko sirf “What to do” dikhate hain aur “How to do it” chhupa lete hain. Isse system simple, secure aur easy-to-use ban jaata hai.     Real-Life Example: TV Remote TV Remote abstraction ka perfect example hai. Aap remote me bas Volume Up , Channel Change , Power jaisa button dabate ho. Aapko nahi pata hota ki andar circuit kaise signal create karta hai, TV tak kaise pahuchta hai, software usse kaise process karta hai. Aapko sirf zaruri functionality dikh rahi hai → This is Abstraction! Agar company remote ki chip badal bhi de, aapka use karna same hi rahta hai. Programming Me Data Abstraction Coding me Data Abstraction ka matlab hota hai ki hum classes aur functions ko aise design karein ki: User ko sirf use karne layak functions dikhaye dein. Un functions ke andar kya logic chal raha hai, woh poora hid...
Read more

Data Structure Ka Parichay Aur Prakar (Introduction and Types of Data Structure)

Image
  1. Data Structure Ki Definition Data Structure ek logical aur systematic tareeka hai jisme data elements ko organize kiya jata hai taki essential operations jaise search, add aur delete efficiently kiye ja sake kam time aur memory mein. Simple Example: Ek library ko consider karo. Books (data) ko shelves (data structures) mein unke subjects ke hisaab se arrange kiya jata hai, taki jab aap koi book dhundho to turant mil jaye. 2. Data Structures Ke Prakar Data Structures mainly do categories mein divide hote hain: Primitive aur Non-Primitive . A. Primitive Data Structures Ye basic data types hote hain jo directly machine level par kaam karte hain. Programming languages inhe pre-defined provide karti hain. Integer (int): Poorn sankhyaon ko store karta hai. Example: 10, -5, 1000 Float/Double: Dashmlav sankhyaon ko store karta hai. Example: 3.14, 0.005 Character (char): Single akshar ya symbol store karta hai. Example: 'A', 'z', '9' Boolean (bo...
Read more

Data Abstraction

Image
  What is Data Abstraction? Data Abstraction means showing only the important information to the user and hiding all the internal working details. In simple words: Show what to do . Hide how it works . This makes a system easy to use, clean, and less confusing.   Real-Life Example: TV Remote When you use a TV remote: You only press buttons like Volume Up, Volume Down, or Channel Change. You do not see how the signal travels inside the remote, how the chip works, or how the TV processes the signal. You only see the basic functions. The internal working is hidden. This is called Abstraction . Data Abstraction in Programming In programming, abstraction means that: The user only sees the required functions or methods. The logic inside those functions remains hidden. Example: When you call saveData(data) in a program: You only know that the data will be saved. You do not know whether it is saved using SQL, NoSQL, a file system, or something else. The internal process is hidden fro...
Read more