Properties of an Algorithm

Algorithm: An algorithm is a set of steps to solve a particular problem.

1. Input: An algorithm should have some inputs.

2. Output: At least one output should be returned by the algorithm after the completion of the specific task based on the given inputs.

3. Definiteness: Every statement of the algorithm should be clear and unambiguous.

4. Finiteness: No infinite loop should be allowed in an algorithm.
Example:

while(1<2)
{
 number=number/2;
}

5. Effectiveness: Writing an algorithm is a priori process of actual implementation of the algorithm. So, a person should analyze the algorithm in the finite amount of time with a pen and paper to judge the performance for giving the final version of the algorithm.

Recommended Posts:

Data Structure
    1. Properties of an Algorithm
    2. Algorithm Life Cycle
    3. Asymptotic Notations – Big O, θ, Ω and ω
    4. Array Representation in Data Structure
    5. Stack Operations
    6. Implementation of Stack using Array
    7. Arithmetic Expression in Data Structure
    8. Algorithm Insertion and Deletion in Queue in Data Structure
    9. Algorithm for Checking Queue is Full or Empty Condition
    10. Circular Queue in Data Structure
    11. Deque implementation
    12. Priority Queue in Data Structure
    13. Implementation of Queue using Stacks
    14. Types of Linked List
    15. Algorithm to Delete a Node in Singly Linked List
    16. Algorithm to Reverse a Singly Linked List
    17. Algorithm to Insert a Node in Doubly Linked List
    18. Algorithm to Delete a Node in Doubly Linked List
    19. Create Polynomial using Linked List
    20. Polynomial Addition using Linked List
    21. Types of Recursion in Data Structure
    22. Algorithm to Find Factorial of a Number using Recursion
    23. Algorithm to Find GCD of Two Numbers using Recursion
    24. Algorithm for Fibonacci using Recursion
    25. Tower of Hanoi Algorithm Recursive
    26. Tail Recursion in Data Structure
    27. Difference Between Recursive and Iterative
    28. Tree Terminology in Data Structure
    29. Binary Tree Representation in Data Structure
    30. Binary Tree Traversal Methods in Data Structure
    31. Binary Search Tree Algorithm in Data Structure
    32. Heap Implementation in Data Structure
    33. Weight Balanced Tree in Data Structure
    34. AVL Tree Insertion and Deletion Algorithm
    35. Threaded Binary Tree in Data Structure
    36. Characteristics of M-way Search Tree
    37. B-Tree in Data Structure
    38. Graph Terminology in Data Structure
    39. Graph Representation in Data Structure
    40. Graph Traversal in Data Structure
    41. Dijkstra’s Algorithm Example Step by Step
    42. Floyd-Warshall Algorithm in Data Structure
    43. Bubble Sorting in Data Structure
    44. Insertion Sorting in Data Structure
    45. Selection Sorting in Data Structure
    46. Merge Sort in Data Structure
    47. Quick Sort in Data Structure
    48. Heap Sort Algorithm in Data Structure
    49. Radix Sort Algorithm in Data Structure
    50. Searching Techniques in Data structure
    51. Hash Function in Data Structure
    52. Collision Resolution Techniques in Data Structure