Jumat, 28 Juni 2013

Tugas STRUKTUR DATA II ( INSERTION )

SCRIPTS INSERTION

#include <stdio.h>
#include <iostream>

using namespace std;

void tampilData(int data[], int max);
void insertionSort(int data[], int max);
int main(){
    int data []= {7,4,10,9,6};
    int max = sizeof(data)/sizeof(int);
    int urut [max];

   insertionSort(data, max);

    return 0;
}
void insertionSort(int data[], int max) {
    tampilData(data, max);

    int temp;
    int j;
/*

    for (int i=1;i<max;i++) {
        temp = data[i];
        for (int j=i-1; j>=0; j++){
            if (temp>data[j]) {
                break;
            } else {
                 data[j+1] = data[j];
            }
        }
        cout << "\n";


            }
*/
    int cari = 4;
    int i;
    for (i=0; i<max; i++){
        if (data[i]==cari) {
            break;
        }
    }
    cout << "Data yang di cari ada pada Array nomor =  "  <<i<< "\n";

    for (int i=1;i<max;i++) {
        temp = data[i];
        for (int j=i-1; j>=0; j++){
            if (temp>data[j]) {
                break;
            } else {
                 data[j+1] = data[j];
            }
        }
        temp = data[i];//Data yang sesuai penunjuk dimasukkin ke temp
        tampilData(data,max);
        cout << "\n";
    }


    tampilData(data,max);
}

void tampilData(int data[], int max){
    cout << "\n";
    for (int i=0;i<max; i++) {
        cout << "\t" << data[i];
    }
       cout << "\n";

}



Tidak ada komentar:

Posting Komentar