## Division of Two Numbers using Binary Search Algorithm

In this post, we will discuss division of two numbers (integer or decimal) using Binary Search (Divide and Conquer) Algorithm.

Coding made easy

In this post, we will discuss division of two numbers (integer or decimal) using Binary Search (Divide and Conquer) Algorithm.

Given an binary array of size two having alteast one element as zero, write a single line function to set both its elements to zero. Use of ternary operator and direct assignment of elements are not allowed.

Given a number, find out if it is even or odd without using any conditional statement (if-else) or ternary operator.

Write an program to perform division of two numbers without using division operator (‘/’).

We are given set of bipolar magnets each domino-shaped. The objective is to place magnets on a M X N board which should meet a set of conditions where both N and M are not odd.

Write a program to print all numbers between 1 to N without using semicolon.

Given two integers, swap them without using any third variable.

What should be the if condition in below code snippet, so that output would be “Hello World”. if “condition” printf (“Hello”); else printf(“World”);

Given three integers, find maximum and minimum number between them without using conditional statement or ternary operator.

Given a large number N, find all positive numbers less than N that can be represented as sum of two cubes for at-least two different pairs. In other words, find all positive numbers M less than given number N that can be expressed as M = (a^3 + b^3) = (c^3 + d^3) for …

Write a program to print “Hello World” with empty main function i.e. without writing anything inside main() function.