package de.ugoe.cs.autoquest.tasktrees.alignment.algorithms;


import java.util.Random;

public class NumberSequence  {
	private int[] sequence;
	private int signature;
	
	public NumberSequence(int size) {
		
		sequence = new int[size];
	}
	
	public int[] getSequence() {
		return sequence;
	}
	public void setSequence(int[] sequence) {
		this.sequence = sequence;
	}
	public int getSignature() {
		return signature;
	}
	public void setSignature(int signature) {
		this.signature = signature;
	}
	
	public void printSequence()
	{	
		for (int i = 0; i < sequence.length; i++) {
			System.out.format("%5d", sequence[i]);
		}
		System.out.println();
	}
	
	public NumberSequence shuffle(){
		NumberSequence result = new NumberSequence(sequence.length);
		result.setSequence(this.sequence);
		Random rgen = new Random();
		
		for (int i=0; i<result.sequence.length; i++) {
		    int randomPosition = rgen.nextInt(result.sequence.length);
		    int temp = result.sequence[i];
		    result.sequence[i] = result.sequence[randomPosition];
		    result.sequence[randomPosition] = temp;
		}
		return result;
		
	}

	public int size() {
		return sequence.length;
	}
}