Set the bit at Kth position of integer n 

#include <iostream> 
using namespace std; 
  
//function to set Kth bit of integer n
unsigned setBit(unsigned int n, unsigned int k) 
{ 
    int result = n | (1 <<(k - 1)); 
    return result; 
} 
  
int main() 
{ 
    unsigned int n = 10, k = 1;
    unsigned int result = setBit(n, k);
    cout << "After setting bit of position " << k << " integer "<< n << ", we get  "<< result<<"." << endl; 
    return 0; 
}

Comments

Post a Comment

Popular posts from this blog

Clear right most set bit of an integer n

  #include <iostream> using namespace std; //function to clear rightmost set bit of integer n unsigned clearRightMostSetBit(unsigned int n) { int result = n & (n - 1); return result; } int main() { unsigned int n = 8; unsigned int result = clearRightMostSetBit(n); cout << "After clearing right most set bit of integer "<< n << ", we get "<< result<<"." << endl; return 0; }
Read more

Advancing through an Array

  #include <iostream> #include <vector> using namespace std; bool canReachEnd(vector<int>& v) { int last_index = v.size()-1; int furthest_index = 0; for (int i = 0; i <= furthest_index && furthest_index < last_index; i++) { furthest_index = max(furthest_index, i + v[i]); } return (furthest_index >= last_index); } int main() { vector<int> v = { 3,2,0,0,2,0,1 }; bool result = canReachEnd(v); if (result) { cout << "We can reach the end of array.\n"; } else { cout << "We can't reach the end of array.\n"; } }
Read more

Partial Sum

  #include <iostream> #include <vector> using namespace std; int partial_sum(vector<int>& sum, int x, int y) { return sum[y] - sum[x - 1]; } void sum_array(vector<int>& v, vector<int>& sum) { sum.push_back(v[0]); for (auto i = 1; i < v.size(); i++) { sum.push_back(sum[i - 1] + v[i]); } } int main() { vector<int> v = { 7, 3, 5, 6, 7, 9, 3, 5, 11 }; vector <int> sum; sum_array(v, sum); // for (auto i = sum.begin(); i != sum.end(); i++) // cout << *i << " "; cout << partial_sum(sum, 3, 7); return 0; }
Read more