How I Apply Complement For Binary Value Of 8 Bit Alternatively?

Question

1.00/5 (3 votes)

See more:

please send me the coding with out using bitset and bitget function please send me the coding

eg:
29=00011101
apply complement to 1st,3rd,5th,7th position from right to left
i got 72=01001000

please send me the coding

Posted 13-Feb-15 16:22pm

haripriyapavithra

Updated 13-Feb-15 18:47pm

Sergey Alexandrovich Kryukov

v2

Add a Solution

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

super · Answer 1 · 2015-03-18T02:46:00

Well it really odd why you want to do this without bitset or bitget function. But anway here is the algorithm to do the same

0. Convert the number to bit array
1. Iterate with the array
1.1. newbit= 1- oldbit for each odd elements
2. Convert the bit array to number.

or
use this in step 1 array(0:1:end) = 1 - array(0:1:end);