Circle the number next to the sorting algorithm that would be the best (i. e., most efficient) for each scenario in order to reduce the expected running time. a) You are running a library catalog. You know that the books in your collection are almost in sorted ascending order by title, with the exception of one book which in the wrong place. You want the catalog to be completely sorted in ascending order. i) Insertion Sort ii) Merge Sort iii) Radix Sort iv) Heap Sort v) Counting Sort

When you collaborate or meet with a person or group online, it is called

Consider the following statements: struct nametype{string first; string last; }; struct coursetype{string name; int callnum; int credits; char grade; }; struct studenttype{nametype name; double gpa; coursetype course; }; studenttype student; studenttype classlist[100]; coursetype course; nametype name; mark the following statements as valid or invalid. if a statement is invalid, explain why.a.) student.course.callnum = "csc230"; b.) cin > > student.name; c.) classlist[0] = name; d.) classlist[1].gpa = 3.45; e.) name = classlist[15].name; f.) student.name = name; g.) cout < < classlist[10] < < endl; h.) for (int j = 0; j < 100; j++)classlist[j].name = name; i.) classlist.course.credits = 3; j.) course = studenttype.course;

Donnie does not have powerpoint. which method would be best for elana to save and share her presentation as is? a pdf a doc an rtf a ppt