vector of pointers vs vector of values

there are two ways that i know of to create vectors
vector<type> or vector<type*>
with the former you must call
vector.resize(number_instances_of_type);
the latter
vector.push_back(new type);

I was thinking about the way memory is allocated. when you get right down to it they both must allocate memory in much the same way, the only obvious difference being vector.push_back(new type) calls the constructor. anything you guys can add to or correct in these statements?

With the former you can call vector.push_back(type());
With the latter, you can call vector.resize(number_of_pointers_to_type);

If you are constructing objects (non-primitives), their constructor is always called. IE, vector.push_back(type()) constructs a default instance of type, then calls it's copy constructor.

Code:

---

#include <vector>
#include <iostream>

class test {
public:
        test() {
                std::cout << "test::test()" << std::endl;
        }
        test(const test& o) {
                std::cout << "test::test(const test&)" << std::endl;
        }
};

int main() {
        std::vector<test> vecOfValues;
        vecOfValues.push_back(test());
       
        std::vector<test*> vecOfPointers;
        vecOfPointers.resize(3); // 3 null pointers
        for (int i = 0; i < 3; ++i) {
                std::cout << vecOfPointers[i] << '\n';
        }
        return 0;
}

---

Use a vector of values unless you need polymorphism.