Scribd Logo
Upload

Welcome to Scribd!

  • Prak6 Larik

    Uploaded by

    Muhammad Ghozy
    2 views3 pages
    This C++ program sorts an array of integers using a bubble sort algorithm. It takes user input to populate an initial array, prints the array before and after sorting, and uses nested for loops in the Sort_Larik function to compare adjacent elements and swap them if out of order, repeatedly passing through the array until it is fully sorted.

    Original Description:

    Original Title

    Prak6_Larik

    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 C++ program sorts an array of integers using a bubble sort algorithm. It takes user input to populate an initial array, prints the array before and after sorting, and uses nested for loops in the Sort_Larik function to compare adjacent elements and swap them if out of order, repeatedly passing through the array until it is fully sorted.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    2 views3 pages

    Prak6 Larik

    Uploaded by

    Muhammad Ghozy
    This C++ program sorts an array of integers using a bubble sort algorithm. It takes user input to populate an initial array, prints the array before and after sorting, and uses nested for loops in the Sort_Larik function to compare adjacent elements and swap them if out of order, repeatedly passing through the array until it is fully sorted.

    Copyright:

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

    Larik

    //SortLarik.cpp
    //Mengurutkan isi larik
    #include <iostream>
    using namespace std;
    void Baca_Larik(int M, int A[]);
    void Cetak_Larik(int M, int A[]);
    void Sort_Larik(int M, int A[]);
    int main() {
    const int N=6;
    int A[N];
    int pilihan;
    Baca_Larik(N,A);
    cout << "Larik sebelum di Sort : \n";
    Cetak_Larik(N,A);
    // Lakukan sort
    Sort_Larik(N,A);
    cout << "Setelah di Sort : \n";
    Cetak_Larik(N,A);

    system("PAUSE");
    return 0;
    }
    void Baca_Larik(int M, int A[]) {
    int indeks;
    for (indeks=0; indeks <M; indeks++) {
    cout << "Masukkan elemen ke-" << indeks+1 << " : ";
    cin >> A[indeks];
    }
    }
    void Cetak_Larik(int M, int A[]){
    int indeks;
    cout << endl << endl;
    for (indeks=0; indeks < M; indeks++) {
    cout << A[indeks] << " ";
    }
    cout << endl << endl;
    }
    void Sort_Larik(int M, int A[]) {
    int idx1, idx2, temp;
    for (idx1=0; idx1 <(M-1); idx1++) {
    for (idx2=idx1+1; idx2<M; idx2++) {
    if (A[idx1] > A[idx2]) {
    temp = A[idx1];
    A[idx1]=A[idx2];
    A[idx2]=temp;
    }
    }
    }
    }

    You might also like