EmbLogic » Ankit Narang

Binary search for sorted arrays of 10 elements

Ankit Narang — Wed, 25 Feb 2015 10:51:47 +0000

#include
#define SIZE 10
int main()
{
int i,arr[SIZE],key;
int l=0,h=SIZE-1,m;
printf(“Enter the numbers in array\n”);
for(i=0;i {
scanf(“%d”,&arr[i]);
}
printf(“Enter the key”);
scanf(“%d”,&key);
while(l<=h)
{
m=(l+h)/2;
if(key==arr[m])
{
printf(“Element %d is found at %d position”,key,m);
break;
}
else if(key {
h=m-1;
}
else if(key>arr[m])
{
l=m+1;
}
if(l>h)
{
printf(“not found”);
break;
}
}
return 0;
10,3-17 Top
}

Swapping without third variable

Ankit Narang — Mon, 23 Feb 2015 12:54:29 +0000

#include
int main()
{
int i,j;
printf(“Enter the value of i:”);
scanf(“%d”,&i);
printf(“Enter the value of j:”);
scanf(“%d”,&j);
i=i+j;
j=i-j;
i=i-j;
printf(“%d”,i);
printf(“%d”,j);
return 0;

}

To find Largest and Smallest no.s among five numbers entered from the user

Ankit Narang — Mon, 23 Feb 2015 12:48:12 +0000

#include
int main()
{
int a,b,c,d,e,largest,smallest;
printf(“enter five integers\n”);
scanf(“%d%d%d%d%d”, &a,&b,&c,&d,&e);
largest = a;
if (b > largest)
{
largest=b;
}
if (c > largest)
{
largest=c;
}
if (d > largest)
{
largest=d;
}
if (e > largest)
{
largest=e;
}
printf(“largest number is = %d\n”,largest);
smallest = a;
if (b < smallest)
{
smallest=b;
}
if (c < smallest)
{
smallest=c;
}
if (d < smallest)
{
smallest=d;
}
if (e < smallest)
{
smallest=e;
}
printf(“smallest number is = %d\n”,smallest);
return 0;
}

value of resistor color code using switch statement

Ankit Narang — Mon, 16 Feb 2015 09:50:57 +0000

#include
int main()
{
char i;
printf(“Enter the value of i”);
scanf(“%c”,&i);
switch(i)
{
case ’0′:
printf(“Black”);
break;
case ’1′:
printf(“brown”);
break;

case ’2′:
printf(“Red”);
break;
case ’3′:
printf(“Orange”);
break;
case ’4′:
printf(“Yellow”);
break;
case ’5′:
printf(“Green”);

break;

case ’6′:

printf(“Grey”);
}

return 0;
}