Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <constrea.h>
- int data[10], n;
- void Tampil()
- {
- for(int i=1;i<=n;i++)
- {
- cout<<data[i]<<" ";
- }
- cout<<endl;
- }
- void insertion_sort()
- {
- int temp,i,j;
- for(i=1;i<=n;i++)
- {
- temp = data[i];
- j = i -1;
- while(data[j]>temp && j>=0)
- {
- data[j+1] = data[j];
- j--;
- }
- data[j+1] = temp;
- Tampil();
- }
- cout<<endl;
- }
- main()
- {
- cout<<"===PROGRAM INSERTION SORT==="<<endl;
- cout<<"masukkan jumlah data = ";cin>>n;
- for(int i=1;i<=n;i++)
- {
- cout<<"Masukkan data ke "<<i<<" : ";cin>>data[i];
- }
- insertion_sort();
- cout<<"\n\n"; //tampilkan data
- cout<<"Data Setelah di Sort : ";
- for(int i=1; i<=n; i++)
- {
- cout<<" "<<data[i];
- }
- cout<<"\n\nSorting Selesai";
- getche();
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement