Exercise32_Oracle.java

static int[][] computeLevenshtein(List<String> wordList, boolean parallel) {
    final int LIST_SIZE = wordList.size();
    int[][] distances = new int[LIST_SIZE][LIST_SIZE];
    IntStream stream = IntStream.range(0, LIST_SIZE);

    if (parallel) {
        stream = stream.parallel(); // Convert the stream to a parallel one
    }

    stream.forEach(i -> {
        for (int j = 0; j < LIST_SIZE; j++) {
            distances[i][j] = lev(wordList.get(i), wordList.get(j));
        }
    });

    return distances;
}