Minggu, 23 Januari 2022
program cpp
#include
#include
#include
#include
#include
using namespace std;
int sort_function(const void *a, const void *b);
char list[8][9]={"suka","aku","sama","kamu","dulu","sampai","dari","sekarang"};
int main(void)
{
int x,y;
printf("Nama : Muhamad Husni Ramadhan\n");
printf("Nim : 191011400011\n");
printf("Kelas : 04 TPLEE 002\n");
printf("\t\t**Susun Kata**\n\n");
printf("Kata Sebelum di Susun : \n");
for(y=0;y<8;y++)
printf("%s ",list[y]);
printf("\n\nKata Setelah di Susun : \n");
qsort((void *)list, 8, sizeof(list[0]), sort_function);
for(x=0;x<8;x++)
printf("%s\n",list[x]);
return 0;
}
int sort_function(const void *a, const void *b)
{
return (strcmp((char *)a, (char *)b));
}
operasi single linked list pada stack
#include
#include
#include
#define true 1
#define false 0
using namespace std;
typedef struct node *simpul;
struct node
{
char isi;
simpul next;
};
//=============================
//==Prototype Function=========
//=============================
void Sisip_Belakang (simpul&L, char elemen);
void Hapus_Belakang (simpul&L);
void Cetak (simpul L);
//=============================
//==Function Main==============
//=============================
int main()
{
char huruf;
simpul L=NULL; //Pastikan bahwa L kosong
cout<<"NAMA : MUHAMAD HUSNIRAMADHAN"<>huruf;
Sisip_Belakang(L, huruf);
cout<<"Masukan Elemen : ";cin>>huruf;
Sisip_Belakang(L, huruf);
cout<<"Masukan Elemen : ";cin>>huruf;
Sisip_Belakang(L, huruf);
cout<<"Masukan Elemen : ";cin>>huruf;
Sisip_Belakang(L, huruf);
cout<<"Masukan Elemen : ";cin>>huruf;
Sisip_Belakang(L, huruf);
cout<<"Masukan Elemen : ";cin>>huruf;
Sisip_Belakang(L, huruf);
Cetak(L);
//==========================
//==Hapus Simpul Belakang===
//==========================
cout< isi=elemen;
baru-> next=NULL;
if(L==NULL)
L=baru;
else
{
bantu=L;
while(bantu->next!=NULL)
bantu=bantu->next;
bantu->next=baru;
}
}
//******************
//*FUNCTION HAPUS SIMPUL DI BELAKANG******
//******************
void Hapus_Belakang (simpul&L)
{
simpul bantu, hapus;
if(L==NULL)
cout<<"Linked List Kosong.............";
else
{
bantu=L;
while(bantu->next->next!=NULL)
bantu=bantu->next;
hapus=bantu->next;
bantu->next=NULL;
free(hapus);
}
}
//*************
//*FUNCTION MENCETAK ISI LINKED LIST*
//officialdansk
//*************
void Cetak(simpul L)
{
simpul bantu;
if(L==NULL)
cout<<"Linked List Kosong........."<next!=NULL)
{
cout<isi<<"->";
bantu=bantu->next;
}
cout<isi;
}
}
operasi pada single linked list
#include
#include
#include
using namespace std;
typedef struct node *simpul;
struct node
{
char isi;
simpul next;
};
//menggunakan prototype function
void Sisip_Belakang(simpul &L, char elemen );
void Hapus_Depan(simpul &L);
void Cetak(simpul L);
//function main
main()
{
char huruf, ulang, yt;
simpul L = NULL; //pastikan bahwa L kosong
int i, pilih;
cout<<"===================================="<>huruf;
Sisip_Belakang(L , huruf );
}
Cetak(L);
}
if(pilih==2){
//hapus simpul depan
cout<<"\nSetelah Hapus Simpul "<>huruf;
Sisip_Belakang(L , huruf );
}
Cetak(L);
}
if(pilih==3){
cout<<"\nSetelah Hapus Simpul "<>yt;
if (yt == 'Y' || yt == 'y')
goto atas;
else if(yt=='T' || yt=='t')
cout<<"\n";
cout<<"------------Allhamdullilah Selesai----------"<isi=elemen;
baru->next=NULL;
if(L==NULL)
L=baru;
else
{
bantu= L;
while(bantu->next != NULL)
bantu = bantu->next;
bantu->next=baru;
}
}
//function mencetak isi linked list
void Cetak(simpul L)
{
simpul bantu;
if(L==NULL)
cout<<"linked list kosong.........\n";
else
{
bantu=L;
cout<<"\nisi linked list : ";
while(bantu->next !=NULL)
{
cout<isi<<"->";
bantu=bantu->next;
}
cout<isi;
}
}
//function hapus simpul depan
void Hapus_Depan(simpul &L)
{
simpul Hapus;
if(L==NULL)
cout<<"linked list kosong...........\n";
else
{
Hapus=L;
L=L->next;
Hapus->next=NULL;
free(Hapus);
}
}
Langganan:
Postingan (Atom)