Help me learn sorting

[Davey Lopez]

public static void insert(int[]x,int i)
{

int temp=x[i]
intj=i-1;

while(j>=0 && temp<x[j])
{
x[j+1]=x[j];
J--;
}
x[j+1]=temp;
}


Its asking me to sort


2 3 5 9 4

I'm having trouble learning this sorting method. I understand that the first part creates a temp to store the value 4, then the next part creates j to compare the last cell with the second to last cell. The while loop simply makes sure that it doesn't go past the first cell and is comparing the values of the temporary value with that of j(the second to last).

the whole shifting right confuses me
namely the x[j+1]=x[j];
j--

from what i can gather it is taking j's value which is 9 and adding 1 to it but that doesn't make sense to me. I do understand that the j-- is simply subtracting 1 to set up the next comparison in the array

if i was wrong in any part of my summary please tell me as i am eagerly trying to learn this

[K. Tsang]

There are many ways to sort an array or list using the Collections framework. These API can do a whole bunch of stuff.

From your method, is there any restrictions (eg can't use Collection framework or particular methods)?

[Campbell Ritchie]

Why are you calling that method insert?
That looks like code where you are guessing. Assuming you are supposed to write a sort method, I suggest you go back to pencil and paper and write down the algorithm. A lot of sotring methods swap two elements in an array, so maybe a good start is writing a swap method. I shall give you a start

/**
 * blahblah
 */
public class MyUtilities
{
   private MyUtilities()
   {
      /*
       * read this to find out why:-
       * http://docs.oracle.com/javase/specs/jls/se7/html/jls-8.html#jls-8.8.10
       */
   }
// ...
   /**
    * swaps the i-th and j-th elements of the array arr
    * @param arr An array to be altered by swapping its elements
    * @param i index of one of the elements
    * @param j index of the other element
    * @throws ArrayIndexOutOfBoundsException if i or j is < 0 or ≥nbsp;arr.length
    */
   public static void swap(int[] arr, int i, int j)
   {
      if (i != j && arr.length > 1)
      {
         //...
      }
   }
// ...
}

int[] myArray = {1, 2, 69, 4};
MyUtilities.swap(myArray, 2, 3);
System.out.println(Arrays.toString(myArray));
MyUtilities.swap(myArray, 1, 2);
System.out.println(Arrays.toString(myArray));
//etc

Get that working, then look up sorting algorithms. Bubble sort is the least efficient, but you will probably want that because it is the easiest to write and understand.

[Paweł Baczyński]

Campbell Ritchie wrote:Bubble sort is the least efficient, but you will probably want that because it is the easiest to write and understand.

Oh, no. Bubble sort is not the least efficient. The least efficient is Bogosort .

[Campbell Ritchie]

Pawel Pawlowicz wrote: . . . The least efficient is Bogosort .

[Davey Lopez]

Well this is the code straight out of textbook so i'm not guessing at all, can anyone answer my question tough since this is the code my professor wants us to learn

[Paweł Baczyński]

Davey Lopez wrote:from what i can gather it is taking j's value which is 9 and adding 1 to it but that doesn't make sense to me.

If you have j equal to 9 in this program, you are in trouble (because your array is of length 5). The variable j holds an index, not the value.

[Ulf Dittmer]

If you want to learn about sorting, and your instructional materials are not sufficient, Wirth's book Algorithms and Data Structures has a chapter on that. You'll find a link to its free PDF version in https://coderanch.com/how-to/java/HereYouWillFindLinksToFreeStuff

[Campbell Ritchie]

Is that part of a quicksort? Please always tell us where such code is from, to avoid potential copyright problems.

[Davey Lopez]

Pawel Pawlowicz wrote:

Davey Lopez wrote:from what i can gather it is taking j's value which is 9 and adding 1 to it but that doesn't make sense to me.

If you have j equal to 9 in this program, you are in trouble (because your array is of length 5). The variable j holds an index, not the value.

It sorting a hand of playing cards 2, 3, 5, 9, 4.
currently j should be set the the second to last cell as noted by int j=i-1

It's from Java programming from the ground up by ralph braco and shai simonson

can anyone just tell me if I got my assumption about x[j+1]=x[j]; correct?

[fred rosenberger]

Davey Lopez wrote:can anyone just tell me if I got my assumption about x[j+1]=x[j]; correct?

Davey Lopez wrote:from what i can gather it is taking j's value which is 9 and adding 1 to it but that doesn't make sense to me. I do understand that the j-- is simply subtracting 1 to set up the next comparison in the array

No, that is not exactly correct. j is an INDEX into an array. It is keeping track of where you are in the array. So j's value is not 9. j's value is 3. so x[j] means the value at j'th position in the array - that is your 9.

so x[J+1] is the "j+1th" element in the array, or position 4. so we put the value at position three (9) into the slot at position 4, overwriting the value of 4.

[Davey Lopez]

fred rosenberger wrote:

Davey Lopez wrote:can anyone just tell me if I got my assumption about x[j+1]=x[j]; correct?

Davey Lopez wrote:from what i can gather it is taking j's value which is 9 and adding 1 to it but that doesn't make sense to me. I do understand that the j-- is simply subtracting 1 to set up the next comparison in the array

No, that is not exactly correct. j is an INDEX into an array. It is keeping track of where you are in the array. So j's value is not 9. j's value is 3. so x[j] means the value at j'th position in the array - that is your 9.

so x[J+1] is the "j+1th" element in the array, or position 4. so we put the value at position three (9) into the slot at position 4, overwriting the value of 4.

Thank you so much that cleared up everything, I'll post my summary later just to make sure
-thanks again