Scribd Logo
Upload

Welcome to Scribd!

  • Rust Prog Chap3

    Uploaded by

    egondragon
    13 views1 page
    This document provides an example of bubble sorting in Rust. It shows a bubble_sort function that takes a mutable reference to a generic array, iterates through the array comparing adjacent elements and swapping any that are out of order, working to sort the array from least to greatest. The function uses Rust's generic and reference features to implement a basic bubble sorting algorithm as an example of Rust programming.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document provides an example of bubble sorting in Rust. It shows a bubble_sort function that takes a mutable reference to a generic array, iterates through the array comparing adjacent elements and swapping any that are out of order, working to sort the array from least to greatest. The function uses Rust's generic and reference features to implement a basic bubble sorting algorithm as an example of Rust programming.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    13 views1 page

    Rust Prog Chap3

    Uploaded by

    egondragon
    This document provides an example of bubble sorting in Rust. It shows a bubble_sort function that takes a mutable reference to a generic array, iterates through the array comparing adjacent elements and swapping any that are out of order, working to sort the array from least to greatest. The function uses Rust's generic and reference features to implement a basic bubble sorting algorithm as an example of Rust programming.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Rust programming chap3 :

    Programming Rust is a quite interesting experience thanks to the nature of the language

    Find here a basic example to do Bubble sorting:


    fn bubble_sort<T: PartialOrd>(arr: &mut [T]) {
    for i in 0..arr.len() {
    for j in 1..arr.len() - i {
    if arr[j - 1] > arr[j] {
    arr.swap(j - 1, j);
    }
    }
    }
    }

    Orange Restricted

    You might also like