mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-10-06 21:59:30 +00:00
5ef5f67a51
* Update DIRECTORY * Updated DIRECTORY * Fixed bug in directory build and re-build the directory.md * fixed url issue * fixed indentation in Directory.md * Add problem-18 of project-euler * Delete sol1.py * Delete files * Added more details to question * Added doctest in printNGE() * Made changes to fix Travis CI build * Remove the trailing whitespace
25 lines
619 B
Python
25 lines
619 B
Python
def printNGE(arr):
|
|
"""
|
|
Function to print element and Next Greatest Element (NGE) pair for all elements of list
|
|
NGE - Maximum element present afterwards the current one which is also greater than current one
|
|
>>> printNGE([11,13,21,3])
|
|
11 -- 13
|
|
13 -- 21
|
|
21 -- -1
|
|
3 -- -1
|
|
"""
|
|
for i in range(0, len(arr), 1):
|
|
|
|
next = -1
|
|
for j in range(i + 1, len(arr), 1):
|
|
if arr[i] < arr[j]:
|
|
next = arr[j]
|
|
break
|
|
|
|
print(str(arr[i]) + " -- " + str(next))
|
|
|
|
|
|
# Driver program to test above function
|
|
arr = [11, 13, 21, 3]
|
|
printNGE(arr)
|