ohh :(
On 6/23/10, mohit ranjan wrote:
> @Manisha
>
> "swap every two bits"
>
>
> -Mohit
>
>
>
> On Wed, Jun 23, 2010 at 4:56 PM, manisha nandal
> wrote:
>
>> char a=10 01 11 01
>> a = a ^ ~ ( 0 )
>> //now a is 01 10 00 10
>>
char a=10 01 11 01
a = a ^ ~ ( 0 )
//now a is 01 10 00 10
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@go
int main()
{
int a=7,b=2;
char* p=(char*)a;
printf("%p",p); //prints 00 00 00 07
printf("\n%p",p+2); //prints 00 00 00 09
int s=(int)&p[b];//converted to &( *(p+b)) i.e p+b same as above
printf("\n%d",s); // 9
}
hope its clear now
--
You received this message becau
in place constraint is violated in radix sort
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.c
this is not d final solution, trying to find a way
3B, 1R, 4Y, 2R, 5B, 7Y
1) Find max no. in the array i.e 7
max=7
2) assign values as R= max B=2*max Y=3*max
i.e R=7 B=14 R=21
3) 3B = 3 + 14=17
1R = 1 + 7 = 8
4Y = 4 + 21 = 25 and so on
4) numbers are as follows
17, 8, 25,
