Arrays to the finish

Finding pairs

Constructed from memory... I hope it resembles what we did...

Reversing an array...

(Thank you for sending me these!!)

In place

	public class reversereverse {
	public static void main(String[] args){
	int[] data = {1, 2, 3, 4, 5, 6, 7, 8, 9};
	for (int i = 0; i<data.length/2; i++){
	int a = data[i];
	data[i] = data[data.length - i - 1];
	data[data.length - i - 1] = a;
	}
	System.out.println(java.util.Arrays.toString(data));
	}
	}

view raw reversereverse.java hosted with ❤ by GitHub

As a copy

	public class reverseagain {
	public static void main(String[] args){
	int[] data = {1, 2, 3, 4, 5};
	System.out.println(java.util.Arrays.toString(data));
	int[] newData = new int[data.length];
	System.out.println(java.util.Arrays.toString(newData));
	for(int i=0; i<data.length; i++){
	newData[i] = data[data.length - i -1];
	System.out.println(java.util.Arrays.toString(newData));
	}
	System.out.println(java.util.Arrays.toString(newData));
	}
	}

view raw reverseagain.java hosted with ❤ by GitHub

Some cellular automaton thing

That we didn't really finish... so don't worry about what it means :)

	public class Cells {
	public static void main(String[] args) {
	int[] data = { 0, 1, 1, 0, 1, 0 };
	System.out.println(java.util.Arrays.toString(data));
	int[] data2 = new int[data.length];
	for (int i=0; i<data.length; i++) {
	if (data[i] == 1) {
	data2[i] = 0;
	}
	else {
	data2[i] = 1;
	}
	}
	System.out.println(java.util.Arrays.toString(data2));
	}
	}

view raw Cells.java hosted with ❤ by GitHub

See you Tuesday!