Given an unsorted std::vector and a number n, what is the worst-case time complexity for finding the pair of integers whose sum is closest to n, using no additional memory? For example, given the vector(12, 3, 17, 5, 7} and n = 13, we would get the pair(5, 7).
A.Θ(log n)
B.Θ(n)
C.Θ(n log n)
D.Θ(n2)
E.0(29

Write a program which asks you to enter a name in the form of first middle initial last. so you might enter for example samuel p. clemens. use getline to read in the string because it contains spaces. also, apparently the shift key on your keyboard doesn’t work, because you enter it all lower case. pass the string to a function which uses .find to locate the letters which need to be upper case and use toupper to convert those characters to uppercase. the revised string should then be returned to main in the form last, first mi where it will be displayed.

1. before plugging in a new device to a computer you should unplug all other devices turn off the computer turn on the computer 2. many of the maintenance tools for a computer can be found in the control panel under administrative tools display personalization

Q13 what function does a security certificate perform? a. creates user accounts b. scrambles data c. identifies users d. creates password policies e. provides file access