Sorting neighbor = new Sorting(currentSolution);
int randomIndex1 = randomizer.nextInt(currentSolution.getAmountOfNumbers());
int randomIndex2 = randomizer.nextInt(currentSolution.getAmountOfNumbers());
neighbor.swapIndices(randomIndex1, randomIndex2);
return neighbor;
}
/**
* Checks if we have found the optimal solution with costs zero or if the