Welcome to collectivesolver - Programming & Software Q&A. A website you can trust. All programs tested and works. Contact: aviboots(AT)netvision.net.il
Web Hosting

Bonsai Boy of New York Bonsai Trees and Accessories

BlueHost Web Hosting

Liquid Web iThemes WordPress Hosting

Ecommerce Software - Best Ecommerce Platform Made for You - Free Trial

DreamHost Web Hosting


getResponse autofunnels

Liquid Web Cloud VPS Hosting

11,159 questions

15,235 answers

573 users

How to find the longest increasing not sorted subsequence (LIS) of a sequence of numbers in PHP

1 Answer

0 votes
function not_sorted_lis($arr, $len) {   
    $total = 1;   
     
    for ($i = 0; $i < $len - 1; $i++ ) { 
        if ($arr[$i] < $arr[$i + 1]) {
           $total++;
        }
        echo $arr[$i] . " " . $arr[$i + 1] . " total = " . $total . "<br />";
    } 
   
    return $total;
}  
 
     
$arr = array(4, 5, 1, 10, 7, 9, 18, 19); 
     
echo "LIS length = " . not_sorted_lis($arr, sizeof($arr));  

  
  
/*
run:
       
4 5 total = 2
5 1 total = 2
1 10 total = 3
10 7 total = 3
7 9 total = 4
9 18 total = 5
18 19 total = 6
LIS length = 6
      
*/

 




answered Jun 9 by avibootz
...