c++

QUESTION 6 1. Select the items which are significant properties of sorting algorithms: how many number of lines of code it is written in whether is stable or unstable which programming language it is written in what kind of evaluation return is indicated amount of storage space required number of processing steps required r , QUESTION9 1. Match the two related items. string months [12]: Avectoncstring # include montha (12) B.setpw (8) C sort 0 D.binary search - tincludeciomanip> QUESTION 7 Why would you want to use a binary search instead of linear search? 1. Binary search is faster than linear search in most cases but will be slower if the target is not found. Binary search is more complex than linear search. Binary search usually finds the target much faster than linear search, provided the array is sorted. C C Binary search only hasto look at half the elements in the array, making it twice as fast as linear search QUESTION 10 Which of these is a declaration for an array called prices that holds 25 floating-point values? Cint prices [25]: C prices float [25]: 1. QUESTION B array [25] float-point prices; float [25] prices; float prices [25]; C 1. To use a instead of an a must use the compiler directive (item) to append a new ltem at the end of the container then you can use container (Use a single term for each blank with no punctuation.]