Matematik ve Klasik Bulmacalar (Math & Classic Riddles) Algoritması

1export function karatsubaMultiply(x: number, y: number): number {
2  // Base case for single digit multiplication
3  if (x < 10 || y < 10) return x * y;
4  
5  const xStr = x.toString();
6  const yStr = y.toString();
7  const n = Math.max(xStr.length, yStr.length);
8  const m = Math.floor(n / 2);
9  
10  const p = Math.pow(10, m);
11  
12  const a = Math.floor(x / p);
13  const b = x % p;
14  const c = Math.floor(y / p);
15  const d = y % p;
16  
17  // 3 recursive calls
18  const ac = karatsubaMultiply(a, c);
19  const bd = karatsubaMultiply(b, d);
20  const abcd = karatsubaMultiply(a + b, c + d);
21  
22  const mid = abcd - ac - bd;
23  return ac * Math.pow(10, 2 * m) + mid * p + bd;
24}
25
26export function hanoiMoves(n: number, from: string, to: string, aux: string, trace: string[]): void {
27  if (n === 1) {
28    trace.push(`Disk 1'i ${from} -> ${to} direğine taşı`);
29    return;
30  }
31  hanoiMoves(n - 1, from, aux, to, trace);
32  trace.push(`Disk ${n}'i ${from} -> ${to} direğine taşı`);
33  hanoiMoves(n - 1, aux, to, from, trace);
34}