C++ STL Heap

See attached file for full problem description. Answer question #17. - Heaps, Binary Files, and Bit Sets

C++ STL

See attached file for full problem description. Heaps, Binary Files, and Bit Sets

Sorting Algorithms

We have considered the following sorting algorithms in this book: Heap, Insertion, Merge, Quicksort, Radix, Selection For each sort, give the average and worst case running time and the space requirements, and make some additional comments about the efficiency of the algorithm. The additional comments may specify how probable the worst case is, the number of interchanges performed by the algorithm, and special situations that make the algorithm run faster

C++ - STL - Graphs

See attached file for full problem description. Answer #13e.

Give pseudocode for the bisection method algorithm to find a zero of a continuous function.

A continuous function f(x) such that f(a) and f(b) have opposite signs, must have a zero (a point x such that f(x) = 0) in the interval [a, b]. Give a pseudocode for the bisection method algorithm Bise(f(x),a,b,error) for finding an approximation to a zero of a continuous function f(x) in the interval [a, b] accurate to within error.