Category Archives: Uncategorized

Head’s up: after Wednesday’s quiz, we’ll use the master theorem to determine a big-O estimate for the complexity of the mergesort algorithm. Today you and your partner implemented the merge algorithm on the ordered sets of numbers that you chose. … Continue reading →

Use the depth-first search to produce a spanning tree the given sample graph. Choose a as the root of this spanning tree and assume the vertices are ordered alphabetically. Excuse my horrible drawing 🙂  

Test_2_Review_JJ

Question: Describe an algorithm that determines whether a function from a finite set to another finite set is one-to-one Code/Algorithm: Procedure one-to-one([A=(a1,a2,a3, …], [B= b1, b2, b3 …] : integers) for i = 1 to m k = 0 (counter variable) … Continue reading →

procedure insertion( : binary search tree, : item) root of {a vertex not present in has the value null } while and    if then     if left child of then left child of     else add new vertex as a left … Continue reading →

Monday, February 15 is Presidents’ Day, so our next meeting is Wednesday, February 17. You’ll complete Quiz #2 (based on homework #2) then. Feel free to post discussion questions on the OpenLab at any time. Don’t forget to add the … Continue reading →