-
[게임알고리즘] 1-5강 함수포인터 대응[DSU] 게임알고리즘 2026. 3. 13. 00:56728x90
C/C++
1234567891011121314151617181920212223242526#include <stdio.h>int add(int a, int b){return a+b;}int sub(int a, int b){return a-b;}int mul(int a, int b){return a*b;}int dev(int a, int b){return a/b;}typedef int (*Method)(int a, int b);Method method[] = { add, sub, mul, dev };const char* s[] = { "+", "-", "*", "/" };int main() {int a[4][2] ={{4, 3},{1, 2},{2, 6},{6, 3}};for(int i=0; i<4; i++){int* p = a[i];printf("=================== (%d, %d)\n", p[0], p[1]);for(int j=0; j<4; j++)printf("(%d %s %d) = %d\n",p[0], s[j], p[1], method[j](p[0], p[1]));}return 0;}cs C#
1234567891011121314151617181920212223242526272829303132333435using System;public class HelloWorld{static int add(int a, int b) { return a + b; }static int sub(int a, int b) { return a - b; }static int mul(int a, int b) { return a * b; }static int dev(int a, int b) { return a / b; }public delegate int Method(int a, int b);public static void Main(string[] args){Method[] method = { add, sub, mul, dev };string[] s = { "+", "-", "*", "/" };int[][] a = {new int[]{4, 3},new int[]{1, 2},new int[]{2, 6},new int[]{6, 3}};for (int i = 0; i < 4; i++){int[] p = a[i];Console.WriteLine("=================== (" + p[0] + " ," + p[1] + ")");for (int j = 0; j < 4; j++)Console.WriteLine("(" + p[0] + s[j] + p[1] + ") = " +method[j](p[0], p[1]));}}}cs Java
12345678910111213141516171819202122232425262728293031323334353637383940414243interface Method{public int method(int a, int b);}class Add implements Method{public int method(int a, int b){return a+b;}}class Sub implements Method{public int method(int a, int b){return a-b;}}class Mul implements Method{public int method(int a, int b){return a*b;}}class Dev implements Method{public int method(int a, int b){return a/b;}}class Main {public static void main(String[] args) {Method[] m = { new Add(), new Sub(), new Mul(), new Dev() };String[] s = { "+", "-", "*", "/" };int[][] a ={ {4, 3},{1, 2},{2, 6},{6, 3} };for(int i=0; i<4; i++){int[] p = a[i];System.out.println("=================== (" + p[0] + " ," + p[1] + ")");for(int j=0; j<4; j++)System.out.println("("+ p[0] + s[j] + p[1] + ") = " +m[j].method(p[0], p[1]));}}}cs 
매일 매일 열심히 게임 개발하고 있습니다 '[DSU] 게임알고리즘' 카테고리의 다른 글
[게임알고리즘] 2-2강 정렬 실습 예제 (0) 2026.03.13 [게임알고리즘] 2-1강 정렬 다듬기 최종 (0) 2026.03.13 [게임알고리즘] 1-4강 정렬 (0) 2026.03.13 [게임알고리즘] 1-3강 최소값, 최대값 구하기3 + 정렬 (0) 2026.03.13 [게임알고리즘] 1-2강 최소값, 최대값 구하기2 (0) 2026.03.13

