Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Semrush - keyword research tool

Create your online store today with Shopify

Turn ChatGPT, Claude, Gemini, And CoPilot Into Your Personal Assistant, Business Coach, Content Creator, And More

AFFILIATE MARKETING Your all-in-one performance engine Manage affiliates, creators, and customer referrals in one unified platform—turning every partnership into measurable growth

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Disclosure: My content contains affiliate links.

43,140 questions

56,014 answers

573 users

How to count the number of sorted rows in either increasing or decreasing order in a matrix using Rust

1 Answer

0 votes
fn sorted_count(matrix: &[Vec<i32>]) -> i32 {
    let mut result = 0;

    // Check for strictly increasing rows
    for row in matrix.iter() {
        if row.windows(2).all(|w| w[0] < w[1]) {
            result += 1;
        }
    }

    // Check for strictly decreasing rows
    for row in matrix.iter() {
        if row.windows(2).all(|w| w[0] > w[1]) {
            result += 1;
        }
    }

    result
}

fn main() {
    let matrix = vec![
        vec![1, 2, 3, 4, 5],
        vec![2, 3, 1, 8, 7],
        vec![8, 7, 6, 5, 4],
        vec![5, 7, 8, 9, 10],
    ];

    println!("Number of sorted rows: {}", sorted_count(&matrix));
}



/*
run:

Number of sorted rows: 3

*/

 



answered Oct 1, 2025 by avibootz
...