If Else Statement in Programming
Last Updated :
26 Mar, 2024
An if else statement in programming is a basic programming technique that allows you to make decisions based on certain conditions. It allows your program to execute different pieces of code depending on whether the specified condition evaluates to true or false. This capability is crucial in building dynamic and functional applications.
Importance of If Else Statement:
The importance of if else statements lies in their ability to control the execution of a program. Using if else statements allows developers to apply logic that responds to situations, making programs more versatile and powerful. Whether manipulating user statements, manipulating data, or controlling program flow, if else statements play an important role in programming.
Basic Syntax of If Else Statement:
Generally, the basic syntax of if felse statements follows this pattern:
if (condition) {
// Code block to execute if condition is true
} else {
// Code block to execute if condition is false
}
In this syntax:
- The `if` keyword begins a conditional statement.
- The condition is enclosed in parentheses `()`.
- If the condition evaluates to true, the code block immediately following the `if` statement is executed.
- If the condition evaluates to false, the code block is executed in the `else` statement.
If Else Statement in C:
Here are the implementation of if else statement in C language:
C
#include <stdio.h>
int main() {
// Declare and initialize the variable num
int num = 10;
// Check if num is greater than 0
if (num > 0) {
// If num is greater than 0, print "Number is positive."
printf("Number is positive.\n");
} else {
// If num is not greater than 0, print "Number is non-positive."
printf("Number is non-positive.\n");
}
return 0;
}
OutputNumber is positive.
If Else Statement in C++:
Here are the implementation of if else statement in C++ language:
C++
#include <iostream>
using namespace std;
int main() {
// Declare and initialize the variable num
int num = 10;
// Check if num is greater than 0
if (num > 0) {
// If num is greater than 0, print "Number is positive."
cout << "Number is positive." << endl;
} else {
// If num is not greater than 0, print "Number is non-positive."
cout << "Number is non-positive." << endl;
}
return 0;
}
OutputNumber is positive.
If Else Statement in Java:
Here are the implementation of if else statement in java language:
Java
public class Main {
public static void main(String[] args) {
// Declare and initialize the variable num
int num = 10;
// Check if num is greater than 0
if (num > 0) {
// If num is greater than 0, print "Number is positive."
System.out.println("Number is positive.");
} else {
// If num is not greater than 0, print "Number is non-positive."
System.out.println("Number is non-positive.");
}
}
}
OutputNumber is positive.
If Else Statement in Python:
Here are the implementation of if else statement in python language:
Python
# Declare and initialize the variable num
num = 10
# Check if num is greater than 0
if num > 0:
# If num is greater than 0, print "Number is positive."
print("Number is positive.")
else:
# If num is not greater than 0, print "Number is non-positive."
print("Number is non-positive.")
OutputNumber is positive.
If Else Statement in C#:
Here are the implementation of if else statement in C# language:
C#
using System;
class Program {
static void Main(string[] args) {
// Declare and initialize the variable num
int num = 10;
// Check if num is greater than 0
if (num > 0) {
// If num is greater than 0, print "Number is positive."
Console.WriteLine("Number is positive.");
} else {
// If num is not greater than 0, print "Number is non-positive."
Console.WriteLine("Number is non-positive.");
}
}
}
OutputNumber is positive.
If Else Statement in Javascript:
Here are the implementation of if else statement in javascript language:
JavaScript
// Declare and initialize the variable num
let num = 10;
// Check if num is greater than 0
if (num > 0) {
// If num is greater than 0, print "Number is positive."
console.log("Number is positive.");
} else {
// If num is not greater than 0, print "Number is non-positive."
console.log("Number is non-positive.");
}
OutputNumber is positive.
This if else statement checks if the variable `num` is greater than 0. If so, the function says "Numbers are good."; Otherwise, it prints "Number is non-positive".
Conclusion
If else statements are necessary to implement conditional logic in policy. They provide tools to monitor the system based on specific scenarios, enabling developers to create dynamic and functional applications. Understanding how to properly use if else statements is key to mastering programming languages ​​like C++, Java, etc.
Similar Reads
DSA Tutorial - Learn Data Structures and Algorithms
DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on
7 min read
Non-linear Components
In electrical circuits, Non-linear Components are electronic devices that need an external power source to operate actively. Non-Linear Components are those that are changed with respect to the voltage and current. Elements that do not follow ohm's law are called Non-linear Components. Non-linear Co
11 min read
Quick Sort
QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s
12 min read
Merge Sort - Data Structure and Algorithms Tutorials
Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge
14 min read
Bubble Sort Algorithm
Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir
8 min read
Breadth First Search or BFS for a Graph
Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta
15+ min read
Data Structures Tutorial
Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st
2 min read
Binary Search Algorithm - Iterative and Recursive Implementation
Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc
15 min read
Insertion Sort Algorithm
Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T
9 min read
Dijkstra's Algorithm to find Shortest Paths from a Source to all
Given a weighted undirected graph represented as an edge list and a source vertex src, find the shortest path distances from the source vertex to all other vertices in the graph. The graph contains V vertices, numbered from 0 to V - 1.Note: The given graph does not contain any negative edge. Example
12 min read