In our analysis of the select algorithm(Blum-Floyd-Rivest-Pratt-T arjan) for a block size of 5, we compared the median of the medians with every other element in the input array to partition it. However, that led to more comparisons than we should have done. We could reduce it since we know that at least 3n/10 elements are less than or equal to the median of the medians and similar number of elements is at least greater than or equal to the median of the medians. Obtain a new upper bound on the worst-case number of comparisons using this piece of information. What is the value of the constant

If you embed a word table into powerpoint, what happens when you make edits to the embedded data? a. edits made to embedded data change the data in the source file; however, edits made to the source file will not be reflected in the embedded data. b. edits made to embedded data don't change the data in the source file; however, edits made to the source file will be reflected in the embedded data. c. edits made to embedded data don't change the data in the source file, nor will edits made to the source file be reflected in the embedded data. d. edits made to embedded data will change the data in the source file, and edits made to the source file will be reflected in the embedded data.

Perform the following tasks: a. create a class named testclass that holds a single private integer field and a public constructor. the only statement in the constructor is one that displays the message “constructing”. write a main()function that instantiates one object of the testclass. save the file as testclass.cpp in the chapter 08 folder. run the program and observe the results. b. write another main()function that instantiates an array of 10 testclass objects. save the file as test class array.c . run this program and observe the results.

To maintain clarity and focus lighting might be needed