bkharpuse
BAN USER#include<stdio.h>
#include<conio.h>
int arr[100];
int max=0, max_in,count;
int longest(int,int);
int main()
{
int i,n;
printf("no of elements = ");
scanf("%d",&n);
for(i=0;i<n;i++)
{
printf("\nenter the elements = ");
scanf("%d",&arr[i]);}
for(i=0;i<n;i++)
{
count = 1;
longest(arr[i],n);}
for(i=0;i<max;i++)
{
printf("%d\t",max_in);
max_in++;
}
getch();
return 0;
}
int longest(int in, int n)
{
int i,in_1=in;
for(i=0;i<n;i++)
{
if(arr[i]==in+1)
{
longest(in+1,n);
count=count+1;
break;
}
}
if(count>max)
{
max=count;
max_in = in_1;
}
return 0;
}
#include<stdio.h>
#include<conio.h>
int binary(int);
int swap(int);
int in[100];
int main()
{
unsigned char c;
printf("enter any character=");
scanf("%c",&c);
int d,i,count;
d = (int)c;
printf("%d\n",d);
count = binary(d);
for(i = count;i>=0;i--)
printf("%d",in[i]);
swap(count);
printf("\n\n");
for(i = count;i>=0;i--)
printf("%d",in[i]);
getch();
return 0;
}
int binary(int num)
{
int j=0;
while(num!=1)
{
in[j] = num%2;
num = num/2;
j++;
}
in[j] = 1;
return j;
}
int swap(int a)
{
int i,j;
for(i=a;i>=0;i--)
{
if(i==0)
{}
else{
j = in[i];
in[i] = in[i-1];
in[i-1] = j;
i--;
}}
return 0;
}
#include<stdio.h>
#include<conio.h>
int arr[] = {5,2,7,9,3,6,8,1};
int max=0, max_in,count;
int longest(int);
int main()
{
int i;
for(i=0;i<8;i++)
{
count = 1;
longest(arr[i]);}
for(i=0;i<max;i++)
{
printf("%d\t",max_in);
max_in++;
}
getch();
return 0;
}
int longest(int in)
{
int i,in_1=in;
for(i=0;i<8;i++)
{
if(arr[i]==in+1)
{
longest(in+1);
count=count+1;
break;
}
}
if(count>max)
{
max=count;
max_in = in_1;
}
return 0;
}
#include<stdio.h>
- bkharpuse November 16, 2012int longest_sequence(int*, int);
int main()
{
int arr[100], n, i;
printf("no of element do u wnt to enter= ");
scanf("%d",&n);
for(i=0; i<n; i++)
{
printf("\nenter the value of a[%d] = ",i);
scanf("%d",&arr[i]);
}
longest_sequence(arr,n);
return 0;
}
int longest_sequence(int *ptr, int total)
{
int max_size=1, temp_start, start, count=1, i;
start = *ptr;
for(i=0; i<total; i++)
{
if(ptr[i] == (ptr[i+1]-1))
{
if(count == 1)
temp_start = ptr[i];
count = count+1;
}
else
{
if(count > max_size)
{
max_size = count;
start = temp_start;
}
count = 1;
}
}
for(i=0; i<max_size; i++)
printf("%d\t",start++);
printf("\n");
return 0;
}