Seems include some useless part.

your solution is more efficient. Dont think less code is better code. Faster code is better code.

This is actually not a very good solution(
For the problem of finding the minimum element in this solution, you additionally need to sort the array
In case the length of the array -> to infinity, sorting it will take several orders of magnitude longer than just finding the minimum

That's really smart. I wish I'd thought of that, lol. I'm still learning Java though, so not getting too made at myself, XD.

The method is receiving a reference to the array object, not a copy of the array. Any modifications made to the array will affect other parts of the code that have access to the original array. If you need to preserve the original array value, you can create a copy of the array within the method to prevent it from being modified.

BigO notation. Look it Up

Wouldn't that not be the case because the args array is only rearranged within the scope of this function?

Cool solution :D

Not a suggestion.

I was trying to do this but never figured it out till now.

That's right

If you are using a language with lazy evaluation like Haskell then this is the best practice :-)

(removed)