Solutions of Theory of Algorithms assignment15.4-5

Solutions of Theory of Algorithms assignment15.4-5 - use...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Solutions of Theory of Algorithms Assignment 3 Exercise 15.4-5 To find the longest monotonically increasing subsequence (LMIS) of a sequence of n numbers, we can sort them in an increasing order and store them in another array. Then, we
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: use the LCS function as follows: LMIS (s) T=s //t is temporary array Sorted_T= sort (T) //sort in increasing order LCS-LENGTH (s, sorted_T)...
View Full Document

This note was uploaded on 11/09/2010 for the course CS 11841 taught by Professor Dr.ayman during the Spring '09 term at Alexandria University.

Ask a homework question - tutors are online