The numpy.greater_equal() checks whether x1 >= x2 or not.
Syntax :
numpy.greater_equal(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 Program illustrating # numpy.greater_equal() method    import numpy as geek   a = geek.greater_equal([8., 2.], [5., 3.]) print("Not equal : \n", a, "\n")   b = geek.greater_equal([2, 2], [[1, 3],[1, 4]]) print("Not equal : \n", b, "\n")   a = geek.array([4,2]) b = geek.array([6,2])   print("Is a greater_equal than b : ", a >= b) |
Output :
Not equal : [ True False] Not equal : [[ True False] [ True False]] Is a greater_equal than b : [False True]
Code 2 :
# Python Program illustrating # numpy.greater_equal() method     import numpy as geek   # Here we will compare Float with int values a = geek.array([1.1, 1]) b = geek.array([1, 2])     print("Comparing float with int : ", a < b)     d = geek.greater_equal(a, b) print("\n Comparing float with int using .greater_equal() : ", d) |
Output :
Comparing float with int : [False True] Comparing float with int using .greater_equal() : [ True False]
Code 3 :
# Python Program illustrating # numpy.greater_equal() method     import numpy as geek   # Here we will compare Complex values with int a = geek.array([1j,2]) b = geek.array([1,2])      print("Comparing complex with int : ", a < b)     d = geek.greater_equal(a, b) print("\nComparing complex with int using .greater_equal() : ", d) |
Output :
Comparing complex with int : [ True False] Comparing complex with int using .greater_equal() : [False True]
References :
Note :
These codes won’t run on online IDE’s. Please run them on your systems to explore the working.
This article is contributed by Mohit Gupta_OMG 😀. If you likeneveropen and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to review-team@geeksforgeeks.org. See your article appearing on theneveropen main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
