Skip to main content

Featured

Merge Sort in C++

  Merge Sort in C++ Introduction Merge Sort is a popular sorting algorithm that follows the Divide and Conquer approach. It divides an array into smaller subarrays, recursively sorts those subarrays, and finally merges the sorted subarrays to produce a completely sorted array. In this tutorial, we will learn how to implement Merge Sort in C++ . The program divides the array into two halves using the mid index, recursively sorts both halves, and then combines them using the merge() function. Merge Sort has a time complexity of O(n log n) in the best, average, and worst cases. Table of Contents Algorithm C++ Program Input Sample Output Output Explanation Dry Run Flow of Execution Time Complexity Space Complexity Applications Key Points Interview Questions Frequently Asked Questions Keywords Conclusion Algorithm Start the program. Read the size of the array. Read the array elements from the user. Call the mer...

Set, Clear, Toggle nth Bit in C

Set, Clear, Toggle nth Bit in C

✅ Set, Clear, and Toggle nth Bit in C

#include <stdio.h>

// Function to set the nth bit (make it 1)
int setBit(int num, int n) {
    return num | (1 << n);
}

// Function to clear the nth bit (make it 0)
int clearBit(int num, int n) {
    return num & ~(1 << n);
}

// Function to toggle the nth bit (flip its value)
int toggleBit(int num, int n) {
    return num ^ (1 << n);
}

int main() {
    int num, n;

    printf("Enter a number: ");
    scanf("%d", &num);

    printf("Enter the bit position to manipulate (0-indexed): ");
    scanf("%d", &n);

    printf("\nOriginal number in binary: ");
    for (int i = 31; i >= 0; i--) {
        printf("%d", (num >> i) & 1);
    }

    printf("\n\nAfter setting %dth bit: %d", n, setBit(num, n));
    printf("\nAfter clearing %dth bit: %d", n, clearBit(num, n));
    printf("\nAfter toggling %dth bit: %d", n, toggleBit(num, n));

    printf("\n");

    return 0;
}
  

๐Ÿ“˜ Explanation:

This program demonstrates bit manipulation in C using bitwise operators. The user provides an integer and a bit position (0-indexed). The program then performs:

  • Set Operation: Uses bitwise OR to ensure the nth bit is 1.
  • Clear Operation: Uses bitwise AND with complement to make the nth bit 0.
  • Toggle Operation: Uses XOR to flip the value of the nth bit.
It also prints the binary representation of the original number using bit shifting.

๐Ÿงพ Sample Output:

Enter a number: 10
Enter the bit position to manipulate (0-indexed): 1

Original number in binary: 00000000000000000000000000001010

After setting 1th bit: 10
After clearing 1th bit: 8
After toggling 1th bit: 8
  

๐Ÿ”‘ Keywords:

Bit manipulation in C, set bit operation, clear bit mask, toggle bit using XOR, left shift, binary number handling, C programming, low-level bit logic

๐Ÿ“Œ Hashtags:

#CProgramming #BitManipulation #SetBit #ClearBit #ToggleBit #BinaryInC #CForBeginners #BitwiseOperations

Comments

Popular Posts

๐ŸŒ™