[C++] 부분 배낭 문제 (Fractional Knapsack Problem) / 그리디 알고리즘
#include #include #include #define _CRT_SECURE_NO_WARNINGS using namespace std; int main() { double data[5][2] = { {10, 10}, {15, 12}, {20, 10}, {25, 8}, {30, 5} }; double temp[2]; double total_value = 0.0; double capacity = 30.0; vector details; for(int i=0; i= elem[0]) { capacity -= elem[0]; total_value += elem[1]; details.push_back({elem[0], elem[1], 1}); } else { double fraction = capacity /..
[C++] 이진탐색 구현
#include #include #include #include using namespace std; int binary_search(int arr[], int num, int start, int end) { int index = (start + end) / 2; if (start == end && arr[index] != num) return -100; if (arr[index] == num) return index; else if (arr[index] > num) binary_search(arr, num, start, index - 1); else binary_search(arr, num, index + 1, end); } void main() { int arr[17] = {1, 3, 5, 7, 11..