

Vector

Brief explanation.

Operations & time complexity

Methods	RunningTime
push_back(val)	O(1)
pop()	O(1)
empty()	O(1)

you can use table generator

Implementation

#include <cstido>
#include <iostream>

template<typename T>
class Vector { //use TitleCase for DataStructure implementation
    ---snip---
}

int main() {
    //few lines of code to test your implementation
    Vector<int> v;
    for (int i = 0; i < n; i++) {
        v.push_back(rand()%100);
    }
    sort(v.begin(), v.end())
        for (auto x: v) {
            cout << x << ' ';
        }
}

keep your implementation self-contained.

Related Problems

1. title of easy problem
2. Some hard problem
3. Lily want a phone

add difficulty information(optional)

Related Topics

Stack

Analysis (Optional)

You can add some mathematical things here using KaTex

as a block tag $$ T(N) = O(N*M) $$

or as a inline tag $T(N) = O(N) $

Contributers (Optional)

07.12.2019 contributer1
07.14.2019 typo correction contributer2
07.15.2019 add new section "Analysis" contributer3
07.18.2019 fix bugs in "implementation" contributer4
07.19.2019 improved performance "implementation" contributer5
07.23.2019 refactoring "implementation" contributer6
08.02.2019 add related problems contributer7

Comments