Cosc 336

Please Explain Every Step, and how it works. I want to learn it too.

Write a pseudo code for an O(n^7log3n) algorithm. Please Explain Every Step, and how it works.

Consider the function LSEARCH (d,L) that returns the last vertex in L that contains data d (or nil if d is not in L); that is, if there is more than a copy of d in L, then it returns the last one encountered when traversing the list from the list from the first to the last item.

1. Give pseudo-code for LSEARCH that works from the first to the last element.
2. Give pseudo-code for LSEARCH that works from the last to the first element.

Write the pseudo code for the linear maximum subsequence sum problem. State the worst-case running time for your problem.