numpy.less() in Python

numpy.less(x1, x2[, out]) : checks whether x1 is lesser than x2 or not.
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 lesser than x2 or not.

Code 1 :

 # Python Program illustrating # numpy.less() method     import numpy as geek     a  = geek.less([8., 2.], [5., 3.]) print("Not equal : \n", a, "\n")    b = geek.less([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 lesser than b : ", a < b)

Output :

Not equal :
[False  True]

Not equal :
[[False  True]
[False  True]]

Is a lesser than b :  [ True False]]

Code 2 :

 # Python Program illustrating # numpy.less() 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 lesser than 1 print("Comparing complex with int : ", a < b)    # indicating 1j is lesser than 1 d  = geek.less(a, b) print("\n Comparing complex with int  .less() : ", d)

Output :

Comparing complex with int :  [ True False]

Comparing complex with int  .less() :  [ True False]

Code 3 :

 # Python Program illustrating # numpy.less() method      import numpy as geek     # Here we will compare Float with int values a = geek.array([1.1, 1]) b = geek.array([1, 2])     # indicating 1.1 is greater than 1 print("Comparing float with int : ", a < b)    # indicating 1.1 is greater than 1 d  = geek.less(a, b) print("\n Comparing float with int using  .less() : ", d)

Output :

Comparing float with int :  [False  True]

Comparing float with int using  .less() :  [False  True]

Note :
These codes won’t run on online-ID. Please run them on your systems to explore the working
.
This article is contributed by Mohit Gupta_OMG 😀. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks 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.

My Personal Notes arrow_drop_up

Article Tags :

Be the First to upvote.

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.