Java, Shifting Elements in an Array

java arrays algorithm shift
darksky picture darksky · Nov 1, 2011 · Viewed 250.8k times · Source

I have an array of objects in Java, and I am trying to pull one element to the top and shift the rest down by one.

Assume I have an array of size 10, and I am trying to pull the fifth element. The fifth element goes into position 0 and all elements from 0 to 5 will be shifted down by one.

This algorithm does not properly shift the elements:

Object temp = pool[position];

for (int i = 0; i < position; i++) {                
    array[i+1] = array[i];
}
array[0] = temp;

How do I do it correctly?

Answer

Howard picture Howard · Nov 1, 2011

Logically it does not work and you should reverse your loop:

for (int i = position-1; i >= 0; i--) {                
    array[i+1] = array[i];
}

Alternatively you can use

System.arraycopy(array, 0, array, 1, position);

Related questions

Finding the max/min value in an array of primitives using Java

It's trivial to write a function to determine the min/max value in an array, such as: /** * * @param chars * @return the max value in the array of chars */ private static int maxValue(char[] chars) { int max = chars[0]; for (int ktr = 0; …

Read More
Print out all permutations of an Array

I am working on a program, and I have a function that swaps the positions in an Array of length that is input by a user. However, I am trying to figure out how to print out this function call …

Read More
find an element in a sorted matrix

Problem: Given a matrix in which each row and each column is sorted, write a method to find an element in it. It is a classic interview question, here is my solution boolean F(int[][] matrix, int hs, int he, …

Read More