Algorithm

#include #include using namespace std; vector num; vector tempNum; void MergeDivied(vector *list, int left, int right); void MergeSort(vector &list, int left, int mid, int right); int main() { int n = 0; cin >> n; for (int i = 0; i > temp; num.push_back(temp); tempNum.push_back(0); } MergeDivied(&num, 0, n - 1); for (int i = 0; i < n; i++) { cout

#pragma once #include using namespace std; void Hanoi(int n, int from, int to, int other); int main() { int i = 0; cin >> i;//입력값 //몇 번 이동하는지 { int hanoiNum = 2; for (int y = 0; y 3 ) - Hanoi(n - 1, o..

#include using namespace std; void factorial(int k); int x = 1; int y = 1; int main() { cin >> x;//정수를 입력 받는다. factorial(1); cout