numpy.greater() in Python
Improve
The numpy.greater() checks whether x1 is greater than x2 or not. Syntax :
numpy.greater(x1, x2[, out])
Parameters :
x1, x2 : [array_like]Input arrays. If x1.shape != x2.shape, they must be
broadcastable to a common shape
out : [ndarray, boolean]Array of bools, or a single bool if x1 and x2 are scalars.
Return :
Boolean array indicating results, whether x1 is greater than x2 or not.
Code 1 :
Python
Output :
Not equal : [ True False] Not equal : [[ True False] [ True False]] Is a greater than b : [False False]
Code 2 :
Python
# Python Program illustrating# numpy.greater() method import numpy as geek # Here we will compare Float with int valuesa = geek.array([1.1, 1])b = geek.array([1, 2]) # indicating 1.1 is greater than 1print("Comparing float with int : ", a < b)# indicating 1.1 is greater than 1d = geek.greater(a, b)print("\n Comparing float with int using .greater() : ", d) |
Output :
Comparing float with int : [False True] Comparing float with int using .greater() : [ True False]
Code 3 :
Python
# Python Program illustrating# numpy.greater() method import numpy as geek # Here we will compare Complex values with int a = geek.array([1j,2])b = geek.array([1,2]) # indicating 1j is greater than 1print("Comparing complex with int : ", a < b)# indicating 1j is greater than 1d = geek.greater(a, b)print("\nComparing complex with int using .greater() : ", d) |
Output :
Comparing complex with int : [ True False] Comparing complex with int using .greater() : [False False]
References : https://docs.scipy.org/doc/numpy-dev/reference/generated/numpy.greater.html#numpy.greater Note : These codes won’t run on online IDE’s. So please, run them on your systems to explore the working.
Don't miss your chance to ride the wave of the data revolution! Every industry is scaling new heights by tapping into the power of data. Sharpen your skills and become a part of the hottest trend in the 21st century.
Dive into the future of technology - explore the Complete Machine Learning and Data Science Program by GeeksforGeeks and stay ahead of the curve.
Share your thoughts in the comments

