Bitwise OR Operator (|) in Programming
Last Updated :
23 Jul, 2025
In programming, Bitwise Operators play a crucial role in manipulating individual bits of data. One of the fundamental bitwise operators is the Bitwise OR operator (|). In this article, we’ll discuss the Bitwise OR operator, its syntax, properties, applications, and optimization techniques, and conclude with its significance in programming.
What is Bitwise OR?
Bitwise OR is a binary operation performed on two binary numbers or bits. It compares the corresponding bits of two numbers and produces a new number where each bit is 1 if at least one of the corresponding bits in the original numbers is 1.
The truth table for the Bitwise OR operation is as follows:
In this table, A and B are the variables, and A OR B is the expression representing the logical OR operation. The table shows all possible combinations of truth values for A and B, and the resulting truth value of A OR B for each combination.
The Botwise OR operation is a binary operation that takes two operands (A and B) and returns true (1) if at least one of the operands is true (1). It returns false (0) only when both operands are false (0).
Bitwise OR Operator:
The bitwise OR operator, symbolized by '|', is utilized to perform a logical OR operation between corresponding bits of two operands. Operating at the bit level, this operator evaluates each bit of the operands and produces a result where a bit is set (1) if at least one of the corresponding bits of the operands is set to 1. If both bits are 0, the result bit is also set to 0.
Bitwise OR Operator Syntax:
The Bitwise OR operator (|) is a fundamental component of bitwise operations in programming languages. It operates on individual bits of two integers, comparing each corresponding bit and producing a result based on whether at least one of the bits is set.
result = operand1 | operand2;
Below, we’ll explore the syntax of the Bitwise OR operator in various programming languages:
Bitwise OR Operator in C:
In C , the syntax of the Bitwise OR operator is straightforward:
result = operand1 | operand2;
C
#include <stdio.h>
int main() {
int operand1 = 10; // 1010 in binary
int operand2 = 13; // 1101 in binary
int result = operand1 | operand2;
printf("Result: %d\n", result); // Output: 15 (1111 in binary)
return 0;
}
Bitwise OR Operator in C++:
In C++ , the syntax of the Bitwise OR operator is straightforward:
result = operand1 | operand2;
C++
#include <iostream>
using namespace std;
int main()
{
int operand1 = 10; // 1010 in binary
int operand2 = 13; // 1101 in binary
int result = operand1 | operand2;
cout << "Result: " << result
<< endl; // Output: 15 (1111 in binary)
return 0;
}
Bitwise OR Operator in Java:
In Java , the syntax of the Bitwise OR operator is straightforward:
result = operand1 | operand2;
Java
public class Main {
public static void main(String[] args) {
int operand1 = 10; // 1010 in binary
int operand2 = 13; // 1101 in binary
int result = operand1 | operand2;
System.out.println("Result: " + result); // Output: 15 (1111 in binary)
}
}
Bitwise OR Operator in Python:
In Python , the syntax of the Bitwise OR operator is straightforward:
result = operand1 | operand2;
Python
operand1 = 10 # 1010 in binary
operand2 = 13 # 1101 in binary
result = operand1 | operand2
print("Result:", result) # Output: 15 (1111 in binary)
Bitwise OR Operator in C#:
In C# , the syntax of the Bitwise OR operator is straightforward:
result = operand1 | operand2;
C#
using System;
class MainClass {
public static void Main (string[] args) {
int operand1 = 10; // 1010 in binary
int operand2 = 13; // 1101 in binary
int result = operand1 | operand2;
Console.WriteLine("Result: " + result); // Output: 15 (1111 in binary)
}
}
Bitwise OR Operator in JavaScript:
In JavaScript , the syntax of the Bitwise OR operator is straightforward:
result = operand1 | operand2;
JavaScript
let operand1 = 0b1010; // Binary literal for 1010
let operand2 = 0b1101; // Binary literal for 1101
let result = operand1 | operand2;
console.log("Result:", result); // Output: 15 (1111 in binary)
Applications of Bitwise OR Operator:
The bitwise OR operator finds applications in various programming scenarios, including:
- Bitwise Operations: Similar to other bitwise operators, the bitwise OR operator is extensively used in bitwise operations, where individual bits of binary numbers need to be manipulated.
- Setting or Enabling Flags: In software development, bitwise OR operations are commonly employed to set or enable specific flags within a bit field or integer.
- Merging Bit Patterns: The bitwise OR operator is useful for merging or combining different bit patterns to form a single result, representing a union of the original patterns.
Conclusion:
The bitwise OR operator is a powerful tool in programming, offering precise control over individual bits within binary data. Its versatility makes it invaluable for tasks ranging from bitwise operations to setting flags and merging bit patterns. By understanding and effectively utilizing the bitwise OR operator, programmers can write more efficient and concise code, especially in scenarios where manipulation of binary data is required.
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Hereâs the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem