Elefterios Stamatogiannakis, Following the project gurus's example sequence
of -- 1,2,3,4,3,5,6,7,8,10 -- the numeric sorted ascending subsequence is
found to be 1,2,3,4,5,6,7,8,10 using an automatic variable containing the
most recent monotically increasing sequence member value and traversing the
array sequentially in Big-O(linear time). As a result, the length of the
sorted numeric ascending subsequence is 9. The length of the entire
sequence is 10. So, the sortation percentage is (9/10) * 100% = 90%.
The dynamic programming longest increasing subsequence program from
Wikipedia, takes Big-0(n * log (n)) time. Thank you for your help.
_______________________________________________
sqlite-users mailing list
[email protected]
http://sqlite.org:8080/cgi-bin/mailman/listinfo/sqlite-users
