Skip to main content

Featured

C Program to Solve Two Sum Using Brute Force (With Algorithm & Output)

 Introduction The Two Sum problem is a popular coding interview question where we must find two indices of an array whose values add up to a given target. This program demonstrates a simple brute-force solution in C using nested loops and dynamic memory allocation. Problem Statement Given an integer array and a target value, return the indices of the two numbers such that they add up to the target. Each input has exactly one solution, and the same element cannot be used twice. The result should return the indices, not the values. If no solution exists, return NULL.  Algorithm / Logic Explanation Start the program. Traverse the array using a loop from index 0 to numsSize - 1 . Inside this loop, use another loop starting from i + 1 to numsSize - 1 . For every pair (i, j) , check if nums[i] + nums[j] == target . If condition becomes true: Allocate memory for 2 integers using malloc() . Store indices i and j . Set returnSize = 2 . Return the result poi...
Post a Comment
Read more
Labels

C Program to Toggle All Bits After the Most Significant Bit

C Program to Toggle All Bits After MSB

C Program to Toggle All Bits After the Most Significant Bit

/* * Joseph is learning digital logic subject which will be for his next semester. * He usually tries to solve unit assignment problems before the lecture. * Today he got one tricky question. The problem statement is “A positive integer has been * given as an input. Convert decimal value to binary representation. * Toggle all bits of it after the most significant bit including the most significant bit. * Print the positive integer value after toggling all bits”. Constrains- 1<=N<=100 Example 1: Input : 10 -> Integer Output : 5 -> result- Integer Explanation: Binary representation of 10 is 1010. After toggling the bits(1010), will get 0101 which represents “5”. Hence output will print “5”.*/

A positive integer is given as input. Convert the decimal value to binary, toggle all bits after the most significant bit (including the MSB), and print the resulting positive integer. 


#include <stdio.h>

int main()
{
    int n, temp;
    int result = 0;
    int place = 1;

    printf("Enter the value: ");
    scanf("%d", &n);

    temp = n;

    while (temp > 0)
    {
        int bit = temp & 1;

        // Toggle bit
        bit = bit ^ 1;

        result += bit * place;

        place = place << 1;
        temp = temp >> 1;
    }

    printf("Result = %d\n", result);

    return 0;
}

📘 Explanation:

  • The input number is processed bit by bit using bitwise operators.
  • temp & 1 extracts the last bit of the number.
  • bit ^ 1 toggles the bit (0 → 1, 1 → 0).
  • The toggled bit is added to the result using positional value (place).
  • The number is right-shifted to process the next bit.

This continues until all bits up to the most significant bit are toggled.

🧾 Sample Output:

Enter the value: 10
Result = 5

🔑 Keywords:

C bit manipulation program, toggle bits in C, decimal to binary conversion, bitwise operators in C, output based C programs

📌 Hashtags:

#CProgramming #BitManipulation #DigitalLogic #OutputQuestions #Programming #1printf

🔍 Search Description:

Learn how to toggle all bits of a number after the most significant bit using bitwise operators in C. This program includes explanation, sample output, and a dark-themed layout.

Labels:

Comments

Post a Comment

Popular Posts

🌙