Ove is correct; this is an exercise in writing your own "find the minimum" algorithm. I don't think this is a job for the Arrays class. If the title of this
thread accurately reflects the task required, it's not a job for for sorting algorithms either.
What follows will require lots of work with a pencil and paper; you will have to go through it in your head and write down what the variables will be before you start, after the first stage, etc., etc. My interpretation depends on the title of the thread; if that is not precise, then you will have to alter what follows accordingly.
What you are looking for it the logic behind doing it. Suggest
Write out an array of numbers 9483 12 045654 2845 7980 -3948593 23 -389475 etc.Work out which is the smallestWrite down how you work out the smallest. Hint you do need a "smallest" variable, but you will need to work out what its initial value ought to be.Code that lot and get it working.Work out how you record the index of the array (probably easiest done at the same time as working out the smallest).Code that lot and get it working.Put the smallest item into your queueWork out what "remove the item" means. Does it mean to create an array one element smaller and copy the items into the new array?Draw a diagram of what that means, then code it and get it working.Repeat until your array is emptyEmpty your queue in order into a new array.Eureka!Notice you want to do this task in tiny bits. "How do you eat an elephant? One mouthful at a time."