Kisi-kisi shorting

searching-- shorting- linked list
================================
searching-insert-shorting-buble

================================
SHORTING DATA
-------------
Masukkan NPM  = <input>
Masukkan Nama = <input>
-----------------------
input lagi (y/t) : <input>
-----------------------
NO.    NPM    Nama
-----------------------
1.    <output>    <output>

========================
CONTOH 1 :
--------------
#include "iostream"
#include "string"
using namespace std;
void main () {
int A[10]; //inisial array
int dummy1;
float jumlah=0;
string nama[10], dummy2;
int n;
cout<<"Masukkan Banyak Data : ";cin>>n;
cout<<"-------------------------\n";
for (int i=0;i<n;i++)
{
cout<<"Masukkan NPM  : " ;cin>>A[i];
cout<<"Masukkan Nama : " ;cin>>nama[i];
jumlah=jumlah+A[i];
}
//bubble sort
for (int i=0;i<n-1;i++)
for (int j=n-1;j>i;j--)
if (A[j-1]>A[j])  //compare
{ //if true then swap
    dummy1 = A[j-1];
    A[j-1]= A[j];
    A[j]  = dummy1;
    //also swap its name
    dummy2 = nama[j-1];
    nama[j-1]= nama[j];
    nama[j]  = dummy2;
}
//cetak A yang telah terurut
cout<<endl;
cout<<"  >>>SHORTING DATA<<<  \n";
cout<<"-------------------------\n";
cout<<"  NO   |  Nama   |   NPM   \n";
cout<<"-------------------------\n";
for (int i=0; i<n;i++)
cout<<"   "<<i+1<<"       "<<nama[i]<<"        "<<A[i]<<"         "<<endl;
cout<<"-------------------------\n";
system ("pause");
}

SEMOGA BERMANFAAT

---