Skip to main content

Featured

C Program to Check Prime Number Using Efficient Logic

  Introduction A prime number is a number that has exactly two distinct positive divisors: 1 and itself. In this program, we check whether a given number is prime or not using a simple and efficient logic. This type of program is commonly used in mathematics, competitive programming, and basic algorithm learning for beginners in C programming. Problem Statement The task is to write a C program that determines whether a given integer is a prime number or not. The program takes a single integer input from the user and analyzes its divisibility. If the number has no divisors other than 1 and itself, it should be identified as a prime number; otherwise, it is not prime. This problem is important in number theory and has practical relevance in areas such as cryptography, data validation, and algorithm design.  Algorithm / Logic Explanation To check whether a number is prime, we need to verify that it is not divisible by any number other than 1 and itself. The algorithm follows a si...

Multiply Two Numbers Without Using * Operator in C

C Program to Multiply Two Numbers Without Using * Operator

✅ C Program to Multiply Two Numbers Without Using * Operator

#include <stdio.h>
int main() {
    int a, b, result = 0;
    printf("Enter two numbers (a * b):\n");
    scanf("%d %d", &a, &b);

    int x = a, y = b;
    while (y > 0) {
        if (y & 1) {        // if last bit of y is 1
            result += x;    // add current value of x
        }
        x <<= 1;            // multiply x by 2
        y >>= 1;            // divide y by 2
    }

    printf("Product is: %d\n", result);
    return 0;
}
  

πŸ“˜ Explanation:

This program performs multiplication without using the multiplication (*) operator. It applies the Russian Peasant Multiplication Algorithm:

  • if (y & 1) → If last bit of multiplier is 1, add current value of multiplicand.
  • x <<= 1 → Left shift doubles the multiplicand.
  • y >>= 1 → Right shift halves the multiplier.
  • Loop continues until multiplier becomes 0.

🧾 Sample Output:

Enter two numbers (a * b):
6 7
Product is: 42
  

πŸ”‘ Keywords:

C program multiplication without *, bitwise multiplication in C, multiply without arithmetic operator, coding interview bitwise questions

πŸ“Œ Hashtags:

#CProgramming #BitwiseOperators #Multiplication #InterviewPrep #LearnC

πŸ” Search Description:

Learn how to multiply two numbers in C without using the multiplication operator (*). Uses bitwise shift and addition. Explained with code and output.

Multiply Two Numbers Without Using * Operator in C

✅ Multiply Two Numbers Without Using * Operator in C

#include <stdio.h>
int main() {
    int a, b, mul = 0;
    printf("Enter any two numbers:\n");
    scanf("%d %d", &a, &b);

    int positive = 1;

    // Handle negative values
    if (b < 0) {
        b = -b;
        positive = -1;
    }

    for (int i = 1; i <= b; i++) {
        mul = mul + a;
    }

    mul = positive * mul;  // Adjust sign

    printf("Multiplication of given numbers is: %d\n", mul);
    return 0;
}
  

πŸ“˜ Explanation:

This program multiplies two numbers without using the * operator. It performs multiplication using repeated addition logic. Here's how it works:

  • If the second number is negative, we make it positive and remember the sign.
  • We add a to the result b times using a loop.
  • Finally, we apply the sign to get the correct result.

πŸ–₯️ Sample Output:

Enter any two numbers:
5 -4
Multiplication of given numbers is: -20
  

πŸ”‘ Keywords:

multiply without star, no multiplication operator, C multiplication with addition, how to multiply in C, multiplication tricks in C, logic building programs

πŸ“Œ Hashtags:

#CProgramming #MultiplyWithoutOperator #BitwiseLogic #NoMultiplication #BeginnerC #OperatorTricks #LogicalCPrograms

πŸ” Search Description:

This C program multiplies two integers without using the multiplication operator (*). It uses a loop with repeated addition, includes sign adjustment for negative numbers, and is useful for learning low-level logic implementation.

Comments

Popular Posts

πŸŒ™