C++ Questions

During the entry of vector data elements by the user, a ______ style loop is often used (since we don't yet know how many items there are). Once data is entered and we are processing the elements we know are there, the loop used is typically a ______ style loop. Given a vector which holds n data items, it should take at most (log_2 n/2^2) operations to place the data in order. Once the data is sorted, we should be able to search through the data in (log_2 n/2^2) average time. (Searching of sorted data is normally done with (linear/binary) search, after all.) If I had not sorted the data first, I would have had to search with (linear/binary) search, which would take (log_2 n/2^2) operations (on average)