Floyd's Cycle Finding Algoritması (Tortoise and Hare)

1function floydCycleFinding(arr: T[]): { cycleExists: boolean; cycleStart?: number; cycleLength?: number } {
2  if (arr.length === 0) {
3    return { cycleExists: false };
4  }
5
6  let tortoise = 0;
7  let hare = 0;
8  
9  do {
10    tortoise = getNextIndex(arr, tortoise);
11    hare = getNextIndex(arr, getNextIndex(arr, hare));
12    
13    if (tortoise === -1 || hare === -1) {
14      return { cycleExists: false };
15    }
16  } while (tortoise !== hare);
17  
18  tortoise = 0;
19  while (tortoise !== hare) {
20    tortoise = getNextIndex(arr, tortoise);
21    hare = getNextIndex(arr, hare);
22  }
23  
24  let cycleLength = 1;
25  hare = getNextIndex(arr, tortoise);
26  while (tortoise !== hare) {
27    hare = getNextIndex(arr, hare);
28    cycleLength++;
29  }
30  
31  return {
32    cycleExists: true,
33    cycleStart: tortoise,
34    cycleLength: cycleLength
35  };
36}