Categories: C

Decision-Making in C

Decision-making in C, as the name suggests, is a way of performing different sets of actions depending on various circumstances.

Shown below is the general form of a regular decision-making structure found in most of the programming languages −

Here, a particular condition statement is tested by the program, which returns true/false accordingly and executes further instructions.

C has three major decision-making instructions-

  • if statement
  • if-else statement
  • switch statement

note: C programming language assumes any non-zero and non-null values as true, and if it is either zero or null, then it is assumed as a false value.

The if statement :

C uses the if keyword to implement the decision control instruction.

Syntax:

if(condition)
{
  //Statement executed if condition is true
}
Key points:
  • The keyword if tells the compiler that what follows is a decision control instruction
  • The condition following the if is always enclosed within a pair of parentheses.
  • If the condition is true, then the statement is executed.
  • If the condition is not true, then the statement is not executed; instead, the program skips past it.
  • Generally, a condition is expressed using relational operators. For instance:
Expressionis true if
x==yx is equal to y
x !=yx is not equal to y
x>yx is greater than y
x<yx is less than y
x>=yx is greater than or equal to y
x<=yx is less than or equal to y
Example:
#include <stdio.h>

int main() {
    int num;
    printf("Enter a number:");
    scanf("%d",&num);
    if(num<10)
    {
        printf("Number is less than 10");
    }
    
    return 0;
}
Input : 3
Output:Number is less than 10
Input :21
Output: 

hence, we can see that no Result is displayed when the input is greater than 10.

Note: also read about Format specifiers in C & Escape Sequence in C.

Follow Me

If you like my post please follow me to read my latest post on programming and technology.

https://www.instagram.com/coderz.py/

https://www.facebook.com/coderz.py

Share
Published by
Rabecca Fatima

Recent Posts

Generate Parenthesis | Intuition + Code | Recursion Tree | Backtracking | Java

Problem Statement: Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. Example…

3 months ago

Square Root of Integer

Given an integer A. Compute and return the square root of A. If A is…

1 year ago

Build Array From Permutation

Given a zero-based permutation nums (0-indexed), build an array ans of the same length where…

1 year ago

DSA: Heap

A heap is a specialized tree-based data structure that satisfies the heap property. It is…

2 years ago

DSA: Trie

What is a Trie in DSA? A trie, often known as a prefix tree, is…

2 years ago

Trees: Lowest Common Ancestor

What is the Lowest Common Ancestor? In a tree, the lowest common ancestor (LCA) of…

2 years ago