numpy.right_shift() function is used to Shift the bits of an integer to the right.
Because the internal representation of numbers is in binary format, this operation is equivalent to dividing arr1 by 2**arr2. For example, if the number is 20 and we want to 2-bit right shift then after right shift 2-bit the result will be 20/(2^2) = 5.
Syntax : numpy.right_shift(arr1, arr2, /, out=None, *, where=True, casting=’same_kind’, order=’K’, dtype=None, ufunc ‘right_shift’)
arr1 : array_like of integer type
arr2 : array_like of integer type
Number of bits we have to remove at the right of arr1.
out : [ndarray, optional] A location into which the result is stored.
-> If provided, it must have a shape that the inputs broadcast to.
-> If not provided or None, a freshly-allocated array is returned.
**kwargs : allows you to pass keyword variable length of argument to a function. It is used when we want to handle named argument in a function.
where : [array_like, optional] True value means to calculate the universal functions(ufunc) at that position, False value means to leave the value in the output alone.
Return : array of integer type.
Return arr1 with bits shifted arr2 times to the right. This is a scalar if both arr1 and arr2 are scalars.
Code #1 : Working
Input number : 20 Number of bit shift : 2 After right shifting 2 bit : 5
Code #2 :
Input array : [24, 48, 16] Number of bit shift : [3, 4, 2] Output array after right shifting: [3 3 4]
- Important differences between Python 2.x and Python 3.x with examples
- Python | Sort Python Dictionaries by Key or Value
- Python | Set 4 (Dictionary, Keywords in Python)
- bin() in Python
- SQL using Python | Set 1
- Python Set | pop()
- Any & All in Python
- Python | a += b is not always a = a + b
- max() and min() in Python
- set add() in python
- try and except in Python
- SHA in Python
- pow() in Python
- abs() in Python
- gcd() in Python
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.