옳은 길로 바르게

Time ComplexityO(n log n)Code#include #include using namespace std;void merge(vector& vec, int left, int mid, int right){ int i,j,k; int fIdx = mid - left + 1; int sIdx = right - mid; vector leftVc(fIdx), rightVc(sIdx); for(i=0; i& vec, int left, int right){ if (left

Use binarySearch to find an element in sorted or monotonic space.#include #include using namespace std;int binarySearch(vector &arr, int x){ int start = 0; int end = (int)arr.size() - 1; while (start Both average and worst case has O(log N) time complexity.

Assuming that prefix and postfix operations perform the same computation,++i is generally more efficient than i++ in terms of cost.Since i++ requires storing the original value in a temporary register, ++i is slightly cheaper.++i add rax, 1 ; i = i + 1i++ mov rcx, rax ; old = i (temporary value) add rax, 1 ; i = i + 1 (original value)

해당 포스트는 cppreference.com을 참조해 작성했습니다. std::arraya container that encapsulates fixed size arrays.it doesn't decay to T* automatically.template struct array;std::vectora sequence container that encapsualteds dynamic size arrays.Except for std::vector partial specialization, the element are stored contiguously, which means that elements can be accessed not only through iterators, but also using off..