It would be greatly appreciated if this announcement could be shared
with educators whose interests include computer science, computer
engineering, and applied computing. Thanks.
---
CALL FOR PAPERS
Paper Submission Deadline (EXTENDED): March 21, 2010
while you scan the array
maintain four indices plus two lengths
two indices and a length mark one sub-array - start,end, length
each such sub-array indicates a non-decreasing sequence,
call them S1 and S2.
while one scans, S2 keeps track of incoming elements (curr sequence)
S1 keeps track of the m
It would be greatly appreciated if this announcement could be
shared with individuals whose research interests include
e-learning, e-business, enterprise information systems, and
e-government. Thanks.
---
CALL FOR PAPERS
Paper Submission Deadline (EXTENDED): Mar
Hello Saurabh,
can you explain the algo??
On Sun, Mar 14, 2010 at 9:55 PM, saurabh gupta wrote:
> O(N)
>
> my @a = @ARGV;
> my ($m, $j, $k, $l) = (0, 0, 0, 0);
> my $len = 0;
> my $curr = 0;
> for (my $i = 1; $i < @a; $i++) {
> if ($a[$i] >= $a[$i-1]) {
> if ($m == $k) {
>
