numpy.floor_divide(arr1, arr2, /, out = None, where = True, casting = ‘same_kind‘, order = ‘K‘, dtype = None) :
Array element from first array is divided by the elements from second array(all happens element-wise). Both arr1 and arr2 must have same shape.
It is equivalent to the Python // operator and pairs with the Python % (remainder), function so that b = a % b + b * (a // b) up to roundoff.
arr1 : [array_like]Input array or object which works as numerator. arr2 : [array_like]Input array or object which works as denominator. out : [ndarray, None, optional]Output array with same dimensions as Input array, placed with result. **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.
An array with floor(x1 / x2)
Code 1 : arr1 divided by arr2
arr1 : [2, 2, 2, 2, 2] arr1 : [2, 3, 4, 5, 6] Output array : [1 0 0 0 0]
Code 2 : elements of arr1 divided by divisor
arr1 : [2, 7, 3, 11, 4] Output array : [0 2 1 3 1]
Code 3 : floor_divide handling results if arr2 has -ve elements
arr1 : [2, 6, 21, 21, 12] arr2 : [2, 3, 4, -3, 6] Output array : [ 1 2 5 -7 2]
- Python | Index of Non-Zero elements in Python list
- Python | Merge Python key values to list
- Python | Convert list to Python array
- Important differences between Python 2.x and Python 3.x with examples
- Reading Python File-Like Objects from C | Python
- Python | Add Logging to a Python Script
- Python | Add Logging to Python Libraries
- Python | Set 4 (Dictionary, Keywords in Python)
- Python | Sort Python Dictionaries by Key or Value
- Python | Visualizing O(n) using Python
- Any & All in Python
- Python vs PHP
- max() and min() in Python
- Python Set | pop()
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.