findmax() is an inbuilt function in julia which is used to return the maximum element of the specified collection along with its index. If there are multiple maximal elements are present in the collection, then the first one will be returned. If there is any data element is NaN, this element is returned.
- itr: Specified collection of elements.
- A: Specified array.
- dims: Specified dimension.
Returns: It returns the maximum elements with their corresponding index.
- Getting minimum element along with its index in Julia - findmin() Method
- Accessing element at a specific index in Julia - getindex() Method
- Julia end Keyword | Marking end of blocks in Julia
- Julia function keyword | Create user-defined functions in Julia
- Julia continue Keyword | Continue iterating to next value of a loop in Julia
- Julia break Keyword | Exiting from a loop in Julia
- Julia local Keyword | Creating a local variable in Julia
- Julia global Keyword | Creating a global variable in Julia
- Getting maximum elements in Julia - maximum() and maximum!() Methods
- Get previous true value from a given array index in Julia | Array findprev() Method
- Get next true value from a given array index in Julia | Array findnext() Method
- Get index of first true value of array in Julia | Array findfirst() Method
- Get index of last true value of array in Julia | Array findlast() Method
- Check if a specific index of an array contains a value in Julia - isassigned() Method
- Iterating over each index of array in Julia - eachindex() Method
- Set elements at a given index of array in Julia - setindex!() Method
- Transform array to its complex conjugate in Julia - conj!() Method
- Getting first index of a collection in Julia - firstindex() Methods
- Getting last index of a collection in Julia - lastindex() Methods
- Number and its Types in Julia
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. 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.