perl 二分法查找.docVIP

#!/usr/bin/perl-w@array=(a,f,b,c,d,ab,e,7,8,23,9);@list=sort(@array);print please input the content you want to look for \n;print if the content exists ,you will get the position\n;chomp ($k=STDIN);$min=0;$max=$#list;if($k lt $list[$min] or $k gt $list[$max]){ printNOT EXIST!\n;}else{ while($k ge $list[$min] and $k le $list[$max]) { if($k eq $list[$min]) { print the content is in NO. ; print $min+1; print \n; last; } elsif($k eq $list[$max]) { print the content is in NO. ; print $max+1; print \n; last; } else { $i=($min+$max)/2;