title: Bitshift time complexity
body: <p>I want to know what is the time-complexity of right bitshift operator >>, preferably in java and if possible other languages like C, Python ... etc too.  Is it O(n) or O(1), where 'n' is the number of bits shifted. I am not looking for a general answer as I know implementation details will differ from each. I want to know which are constant take time O(1), and which take O(n) time.</p>