Kamis, 30 Januari 2014 | Diposting oleh Unknown di 16.25 | 0 komentar

Replace Tulisan Pada Coding Secara Sekaligus

Tips cara me-replace tulisan coding langsung secara banyak. :D

1. Buka Terlebih dahulu Programmer's Notepad.
2. dan buka contoh program codingan kamu.
3. Sebelumnya, kamu blok dulu kata yang ingin di replace.

4. Lalu klik -> Search Pilih yang Replace atau Ctrl + H.

5. Dan selanjutnya .......

6. Untuk finishing -> Klik Raplace/Replace all.
Replace : Hanya satu kata yang diganti.
Replace all : Kata yang diganti sekaligus banyak, sesuai “Find What”.

Rabu, 29 Januari 2014 | Diposting oleh Unknown di 07.45 | 0 komentar

Program Komplit Double Linked List Circular C++

Program Komplit Double Linked List Circular C++.
langsung kita simak ya codingnya kawan...
cekidott ^_^

/* Double Linked List Circular [DLLC]
 Imam Prasetyo - 2012140966 - 03TPLPC [3C]
 Teknik Informatika
 Universitas Pamulang */

#include<cstdlib>
#include<conio.h>
#include<stdlib.h>
#include<stdio.h>
#include<iostream>
using namespace std;

typedef struct TNode
{
 int data_imam;
 TNode *next_imam;
 TNode *prev_imam;
}TNode;
TNode *head_imam, *tail_imam;
int data_imam;

void init_imam();
int isEmpty_imam();
void insertDepan_imam(int databaru_imam);
void insertBelakang_imam(int databaru_imam);
void hapusDepan_imam();
void hapusBelakang_imam();
void clear_imam();
void tampil_imam();
void search_imam() ;
 
int main()
{
 system("cls");
 int key;
  printf("\n");
  printf(" ===================================\n");
  printf(" ||  DOUBLE LINK LIST CIRCULAR    ||\n");
  printf(" ===================================\n");
  printf("           MENU PILIHAN :           \n");
  printf(" ===================================\n");
  printf(" [1] Insert Depan\n");
  printf(" [2] Insert Belakang\n");
  printf(" [3] Hapus Depan \n");
  printf(" [4] Hapus Belakang\n");
  printf(" [5] Tampil / Cetak Data\n");
  printf(" [6] Pencarian Data\n");
  printf(" [7] Hapus Semua List\n");
  printf(" [8] Keluar Program\n");
  printf(" ===================================\n");
  printf(" ===================================\n");
  printf(" ->->Masukan Pilihan Anda < 1 - 7 > : ");
  scanf("%d",&key); 
  if(key==1)  
  {  
   printf(" Masukan data : "); scanf("%d",&data_imam);  
   insertDepan_imam(data_imam); 
   getch();main();
  }  
  else if(key==2)  
  {  
   printf(" Masukan data : "); scanf("%d",&data_imam);  
   insertBelakang_imam(data_imam); 
   getch();main();
  }  
  else if(key==3)  
  {  
   hapusDepan_imam();  
   getch();main(); 
  }  
  else if(key==4)  
  {  
   hapusBelakang_imam();
   getch();main();
  }
  else if(key==5)  
  { 
   tampil_imam();getch();main(); 
  }    
  else if(key==6)  
  {  
   search_imam() ;
   getch();main();
  } 
  else if(key==7)
  {  
   clear_imam();  
   printf(" Semua List Sudah Di Hapus \n");
   getch();main();
  }
  else if(key==8)
  {
   exit(1);
  }
  else  
  {  
   printf("\n Pilihan Anda Salah \n"); 
   getch();main(); 
  }   
}

void init_imam()
{
 head_imam = NULL;
 tail_imam = NULL;
}

int isEmpty_imam()
{
 if(tail_imam == NULL) return 1;
 else return 0;
}

void search_imam() 
{   
 TNode *bantu;
 printf(" Data yang telah anda masukkan :");tampil_imam();
 printf(" Masukan data yang anda ingin cari : "); 
 scanf("%d",&data_imam); 
    bantu=head_imam;
    while(bantu->next_imam!=head_imam)
    {
        if(bantu->data_imam==data_imam)
  {
            cout<<" Data "<<bantu->data_imam<<" Ditemukan "<<endl;
  }
  bantu=bantu->next_imam;
    } 
}

void insertDepan_imam (int data_imambaru)
{
 TNode *baru;
 baru = new TNode;
 baru->data_imam = data_imambaru;
 baru->next_imam = baru;
 baru->prev_imam = baru;
 if(isEmpty_imam()==1)
 {
  head_imam=baru;
  tail_imam=baru;
  head_imam->next_imam = head_imam;
  head_imam->prev_imam = head_imam;
  tail_imam->next_imam = tail_imam;
  tail_imam->prev_imam = tail_imam;
 }
 else 
 {
  baru->next_imam = head_imam;
  head_imam->prev_imam = baru;
  head_imam = baru;
  head_imam->prev_imam = tail_imam;
  tail_imam->next_imam = head_imam;
 }
 printf(" Data telah masuk...\n");
}

void insertBelakang_imam(int data_imambaru)
{
 TNode *baru;
 baru = new TNode;
 baru->data_imam = data_imambaru;
 baru->next_imam = baru;
 baru->prev_imam = baru;
 if(isEmpty_imam()==1)
 {
   head_imam=baru;
   tail_imam=baru;
   head_imam->next_imam = head_imam;
   head_imam->prev_imam = head_imam;
   tail_imam->next_imam = tail_imam;
   tail_imam->prev_imam = tail_imam;
 }
 else 
 {
   tail_imam->next_imam = baru;
   baru->prev_imam = tail_imam;
   tail_imam = baru;
   tail_imam->next_imam = head_imam;
   head_imam->prev_imam = tail_imam;
 }
 printf(" Data telah masuk...\n");
}

void hapusDepan_imam()
{
 TNode *hapus;
 int d;
 if (isEmpty_imam()==0)
 {
  if(head_imam != tail_imam)
  {
   hapus = head_imam;
   d = hapus->data_imam;
   head_imam = head_imam->next_imam;
   tail_imam->next_imam = head_imam;
   head_imam->prev_imam = tail_imam;
   delete hapus;
  } 
  else 
  {
   d = head_imam->data_imam;
   head_imam = NULL;
   tail_imam = NULL;
  }
  printf("%d Terhapus",d);
  }
  else 
  printf(" Masih kosong...\n");
}

void hapusBelakang_imam()
{
 TNode *hapus;
 int d;
 if (isEmpty_imam()==0)
 {
  if(head_imam != tail_imam)
  {
   hapus = tail_imam;
          d = hapus->data_imam;
   tail_imam = tail_imam->prev_imam;
   tail_imam->next_imam = head_imam;
   head_imam->prev_imam = tail_imam;
   delete hapus;
  }
  else 
  {
   d = head_imam->data_imam;
   head_imam = NULL;
   tail_imam = NULL;
  }
  printf(" Terhapus !\n");
 } 
 else 
 printf(" Masih kosong !\n");
}

void tampil_imam()
{
 TNode *bantu;
 bantu = head_imam;
 if(isEmpty_imam()==0)
 {
  do
  {
   printf(" [%d]",bantu->data_imam);
   bantu=bantu->next_imam;
  }
  while(bantu!=tail_imam->next_imam);
  printf("\n");
 } 
 else 
 printf(" Kosong !\n");
}

void clear_imam()
{
 TNode *bantu,*hapus;
 if (isEmpty_imam()==0)
 {
  bantu = head_imam;
  while(bantu->next_imam!=head_imam)
  {
   hapus = bantu;
   bantu = bantu->next_imam;
   delete hapus;
  }
  head_imam = NULL;
 } 
}

Link Download :

DLLC | http://adf.ly/cnKjl

Selasa, 21 Januari 2014 | Diposting oleh Unknown di 21.08 | 0 komentar

Program Double Linked List Non Circular C++

Tugas selanjutnya DLLNC (Double Linked List Non Circular), langsung kita simak ya codingnya kawan...
cekidott ^_^

#include <iostream>
#include <conio.h>  
#include <stdlib.h>
#include<stdio.h>  
  
typedef struct TNode_imam{  
      int data_imam;  
      TNode_imam *next_imam;  
      TNode_imam *prev_imam;  
     } 
TNode_imam;  
TNode_imam *head=NULL;  
void init_imam();  
int IsEmpty_imam();  
void InsertDepan_imam(int value);  
void InsertBelakang(int value);  
void DeleteDepan_imam();  
void DeleteBelakang_imam();  
void ClearAll_imam();  
void Tampill_imam();  
  
int main() 
{  
 int data_imam;  
 int key;  
 do  
 {  
  printf("\n ----------------------------------\n");
  printf(" _DOUBLE LINKED LIST NON CIRCULAR_\n");
  printf(" ________MENU PROGRAM________ \n");
  printf(" ----------------------------------\n");
  printf(" [1] Insert Depan \n");  
  printf(" [2] Insert Belakang \n");  
  printf(" [3] Hapus Depan \n");  
  printf(" [4] Hapus Belakang \n");  
  printf(" [5] Hapus Semua List \n");
  printf(" [6] Keluar Program \n"); 
  printf("\n Pilihan Anda < 1 - 5 > --> ");scanf("%d",&key);  
  system("CLS");  
 
 if(key==1)  
  {  
   printf("\n Masukan data : "); scanf("%d",&data_imam);  
   InsertDepan_imam(data_imam);  
   Tampill_imam();  
  }  
 else if(key==2)  
  {  
   printf("\n Masukan data : "); scanf("%d",&data_imam);  
   InsertBelakang(data_imam);  
   Tampill_imam();  
  }  
 else if(key==3)  
  {  
   DeleteDepan_imam();  
   getch();  
   Tampill_imam();  
  }

else if(key==4)  
  {  
   DeleteBelakang_imam();  
   getch();  
   Tampill_imam();  
  }  
  
 else if(key==5)  
  {  
   ClearAll_imam();  
   printf("\n\n Semua List Sudah Di Hapus \n");  
  }  
 else if(key==6)
 { 
  exit(1);
 }
 else
 {
  printf("\n Pilihan Anda Salah \n");  
  }  
   getch();  
  }  
  while(key);  
 }  // ---> En Program Utama  
  
  
void init_imam()  // ---> Inisiasi  
{  
 head = NULL;  
}  
  
  
int IsEmpty_imam() // ---> Mengecekan kondisi [kosong/tidak]  
{  
 if(head==NULL)  
 return 1;  
 else  
 return 0;  
}  
  
  
void InsertDepan_imam(int value) // ---> Menambahkan data_imam dari depan  
{  
 TNode_imam *baru;  
 baru = new TNode_imam;  
 baru ->data_imam = value;  
 baru ->next_imam = NULL;  
 baru ->prev_imam = NULL;  
 if(IsEmpty_imam()==1)  
 {  
  head = baru;  
  head ->next_imam=NULL;  
  head ->prev_imam=NULL;  
 }  
 else  
 {  
  baru ->next_imam=head;  
  head ->prev_imam=baru;  
  head=baru;  
 }  
 printf(" data Masuk --> ");  
}  
  
  
void InsertBelakang(int value) // ---> Menambahkan data_imam dari belakang  
{  
 TNode_imam *baru, *bantu;  
 baru = new TNode_imam;  
 baru ->data_imam = value;  
 baru ->next_imam = NULL;  
 baru ->prev_imam = NULL;  
 if(IsEmpty_imam()==1)  
 {  
  head = baru;  
  head ->next_imam = NULL;  
  head ->prev_imam = NULL;  
 }  
 else  
 {  
  bantu=head;  
  while(bantu ->next_imam != NULL)  
  {  
   bantu = bantu ->next_imam;  
  }  
  bantu ->next_imam=baru;  
  baru ->prev_imam=bantu;  
 }  
 printf(" data Masuk --> ");  
}  
  
  
void DeleteDepan_imam() // ---> Menghapus data_imam dari depan  
{  
 TNode_imam *hapus;  
 int d;  
 if(IsEmpty_imam()==0)  
 {  
  if(head ->next_imam !=NULL)  
  {  
   hapus = head;  
   d=hapus ->data_imam;  
   head=head ->next_imam;  
   head ->prev_imam = NULL;  
   delete hapus;  
  }  
  else  
  {  
   d=head->data_imam;  
   head=NULL;  
  }  
  printf("\n %d data Terhapus \n",d);  
  printf(" Maka Menjadi --> ");  
    
 }  
 else  
 printf("\n Masih Kosong --> ");  
}  
  
  
void DeleteBelakang_imam() // ---> Menghapus data_imam dari belakang  
{  
 TNode_imam *hapus,*bantu;  
    int d;  
    if (IsEmpty_imam()==0)  
 {  
        if(head->next_imam != NULL)  
  {  
            bantu = head;  
            while(bantu->next_imam->next_imam!=NULL)  
   {  
                bantu = bantu->next_imam;  
            }  
        hapus = bantu->next_imam;  
        d = hapus->data_imam;  
        bantu->next_imam = NULL;  
        delete hapus;  
        }  
 else  
 {  
  d = head->data_imam;  
        head = NULL;  
        }  
        printf("\n %d terhapus \n",d);  
  printf(" Maka Menjadi --> ");  
    }  
 else printf("\n Masih Kosong --> ");  
}  
  
void ClearAll_imam() // ---> Mengahapus semua data_imam(hapus list)  
{  
 TNode_imam *bantu, *hapus;  
 bantu=head;  
 while(bantu !=NULL)  
 {  
  hapus=bantu;  
  bantu=bantu ->next_imam;  
  delete hapus;  
 }  
 head=NULL;  
}  
  
  
void Tampill_imam() // ---> Menapmpilkan list  
{  
 TNode_imam *bantu;  
 bantu=head;  
 if(IsEmpty_imam()==0)  
 {  
  while(bantu !=NULL)  
  {  
   printf(" [%d]", bantu ->data_imam);  
   bantu=bantu ->next_imam;  
  }  
  printf("\n ");  
 }  
 else  
 printf(" data Kosong");  
}

Dan selanjutnya saya akan membuat kebalikannya dari DNLLC tersebut :

/*Program Double Linked List Non Circular terbalik*/
#include<cstdlib>
#include<conio.h>
#include<stdlib.h>
#include<stdio.h>
using namespace std;

typedef struct TNode_ImamPrasetyo
{
 int data_ImamPrasetyo;
 TNode_ImamPrasetyo *next_ImamPrasetyo;
 TNode_ImamPrasetyo *prev_ImamPrasetyo;
}TNode_ImamPrasetyo;
TNode_ImamPrasetyo *head_ImamPrasetyo, *tail_ImamPrasetyo;

void init_ImamPrasetyo();
int isEmpty_ImamPrasetyo();
void insertDepan_ImamPrasetyo(int databaru_ImamPrasetyo);
void insertBelakang_ImamPrasetyo(int databaru_ImamPrasetyo);
void hapusDepan_ImamPrasetyo();
void hapusBelakang_ImamPrasetyo();
void clear_ImamPrasetyo();
void tampil_ImamPrasetyo();
 
int main()
{
 system("cls");
 int data_ImamPrasetyo;
 int key_ImamPrasetyo;
  printf(" -------------------------------------");
  printf("\n |  MENU PROGRAM DLLNC ( Terbalik )  |  \n"); 
  printf(" -------------------------------------\n");
  printf(" [1]. Insert Depan \n");  
  printf(" [2]. Insert Belakang \n");  
  printf(" [3]. Hapus Depan \n");  
  printf(" [4]. Hapus Belakang \n");  
  printf(" [5]. Tampil / Cetak Data \n");
  printf(" [6]. Hapus Semua List \n"); 
  printf(" [7]. Exit \n");
  printf(" -------------------------------");
  printf("\n Masukan pilihan anda [1-7]  = ");scanf("%d",&key_ImamPrasetyo);  
  printf(" -------------------------------\n");
  if(key_ImamPrasetyo==1)  
  {  
   printf(" Masukan Data : "); scanf("%d",&data_ImamPrasetyo);  
   insertDepan_ImamPrasetyo(data_ImamPrasetyo); 
   getch();main();
  }  
  else if(key_ImamPrasetyo==2)  
  {  
   printf(" Masukan Data : "); scanf("%d",&data_ImamPrasetyo);  
   insertBelakang_ImamPrasetyo(data_ImamPrasetyo); 
   getch();main();
  }  
  else if(key_ImamPrasetyo==3)  
  {  
   hapusDepan_ImamPrasetyo();  
   getch();main(); 
  }  
  else if(key_ImamPrasetyo==4)  
  {  
   hapusBelakang_ImamPrasetyo();
   getch();main();
  }
  else if(key_ImamPrasetyo==5)  
  {  
   tampil_ImamPrasetyo();getch();main();   
  }    
  else if(key_ImamPrasetyo==6)  
  {  
   clear_ImamPrasetyo();  
   printf(" Semua List Sudah Di Hapus \n");
   getch();main();
  } 
  else if(key_ImamPrasetyo==7)
  {
   exit(1);
  }
  else  
  {  
   printf("\n Pilihan Anda Salah \n"); 
   getch();main(); 
  }   
}

void init_ImamPrasetyo()
{
 head_ImamPrasetyo = NULL;
 tail_ImamPrasetyo = NULL;
}

int isEmpty_ImamPrasetyo()
{
 if(tail_ImamPrasetyo == NULL) return 1;
 else return 0;
}

void insertDepan_ImamPrasetyo (int databaru_ImamPrasetyo)
{
 TNode_ImamPrasetyo *baru_ImamPrasetyo;
 baru_ImamPrasetyo = new TNode_ImamPrasetyo;
 baru_ImamPrasetyo->data_ImamPrasetyo = databaru_ImamPrasetyo;
 baru_ImamPrasetyo->next_ImamPrasetyo = NULL;
 baru_ImamPrasetyo->prev_ImamPrasetyo = NULL;
 if(isEmpty_ImamPrasetyo()==1)
 {
  head_ImamPrasetyo=baru_ImamPrasetyo;
  tail_ImamPrasetyo=head_ImamPrasetyo;
  head_ImamPrasetyo->next_ImamPrasetyo = NULL;
  head_ImamPrasetyo->prev_ImamPrasetyo = NULL;
  tail_ImamPrasetyo->prev_ImamPrasetyo = NULL;
  tail_ImamPrasetyo->next_ImamPrasetyo = NULL;
 }
 else 
 {
  baru_ImamPrasetyo->next_ImamPrasetyo = head_ImamPrasetyo;
  head_ImamPrasetyo->prev_ImamPrasetyo = baru_ImamPrasetyo;
  head_ImamPrasetyo = baru_ImamPrasetyo;
 }
 printf(" Data masuk!\n");
}

void insertBelakang_ImamPrasetyo(int databaru_ImamPrasetyo)
{
 TNode_ImamPrasetyo *baru_ImamPrasetyo;
 baru_ImamPrasetyo = new TNode_ImamPrasetyo;
 baru_ImamPrasetyo->data_ImamPrasetyo = databaru_ImamPrasetyo;
 baru_ImamPrasetyo->next_ImamPrasetyo = NULL;
 baru_ImamPrasetyo->prev_ImamPrasetyo = NULL;
 if(isEmpty_ImamPrasetyo()==1)
 {
  head_ImamPrasetyo=baru_ImamPrasetyo;
  tail_ImamPrasetyo=head_ImamPrasetyo;
  head_ImamPrasetyo->next_ImamPrasetyo = NULL;
  head_ImamPrasetyo->prev_ImamPrasetyo = NULL;
  tail_ImamPrasetyo->prev_ImamPrasetyo = NULL;
  tail_ImamPrasetyo->next_ImamPrasetyo = NULL;
 }
 else 
 {
  tail_ImamPrasetyo->next_ImamPrasetyo = baru_ImamPrasetyo;
  baru_ImamPrasetyo->prev_ImamPrasetyo = tail_ImamPrasetyo;
  tail_ImamPrasetyo = baru_ImamPrasetyo;
  tail_ImamPrasetyo->next_ImamPrasetyo = NULL;
 }
 printf(" Data masuk!\n");
}

void tampil_ImamPrasetyo()
{
 TNode_ImamPrasetyo *bantu_ImamPrasetyo;
 bantu_ImamPrasetyo = tail_ImamPrasetyo;
 if(isEmpty_ImamPrasetyo()==0)
 {
  while(bantu_ImamPrasetyo!=head_ImamPrasetyo->prev_ImamPrasetyo)
  {
   printf(" [%d]",bantu_ImamPrasetyo->data_ImamPrasetyo);
   bantu_ImamPrasetyo=bantu_ImamPrasetyo->prev_ImamPrasetyo;
  }
 printf("\n");
 } else printf(" Kosong !\n");
}

void hapusDepan_ImamPrasetyo()
{
 TNode_ImamPrasetyo *hapus_ImamPrasetyo;
 int d_ImamPrasetyo;
 if (isEmpty_ImamPrasetyo()==0)
 {
  if(head_ImamPrasetyo->next_ImamPrasetyo != NULL)
  {
   hapus_ImamPrasetyo = head_ImamPrasetyo;
   d_ImamPrasetyo = hapus_ImamPrasetyo->data_ImamPrasetyo;
   head_ImamPrasetyo = head_ImamPrasetyo->next_ImamPrasetyo;
   head_ImamPrasetyo->prev_ImamPrasetyo = NULL;
   delete hapus_ImamPrasetyo;
  }
  else 
  {
   d_ImamPrasetyo = head_ImamPrasetyo->data_ImamPrasetyo;
   head_ImamPrasetyo = NULL;
   tail_ImamPrasetyo = NULL;
  }
  printf(" Terhapus !\n");
 }
 else printf(" Masih kosong !\n");
}

void hapusBelakang_ImamPrasetyo()
{
 TNode_ImamPrasetyo *hapus_ImamPrasetyo;
 int d_ImamPrasetyo;
 if (isEmpty_ImamPrasetyo()==0)
 {
  if(head_ImamPrasetyo->next_ImamPrasetyo != NULL)
  {
   hapus_ImamPrasetyo = tail_ImamPrasetyo;
   d_ImamPrasetyo = tail_ImamPrasetyo->data_ImamPrasetyo;
   tail_ImamPrasetyo = tail_ImamPrasetyo->prev_ImamPrasetyo;
   tail_ImamPrasetyo->next_ImamPrasetyo = NULL;
   delete hapus_ImamPrasetyo;
  } 
  else 
  {
   d_ImamPrasetyo = head_ImamPrasetyo->data_ImamPrasetyo;
   head_ImamPrasetyo = NULL;
   tail_ImamPrasetyo = NULL;
  }
  printf(" Terhapus !\n");
 } 
 else 
 printf(" Masih kosong !\n");
}

void clear_ImamPrasetyo()
{
 TNode_ImamPrasetyo *bantu_ImamPrasetyo,*hapus_ImamPrasetyo;
 bantu_ImamPrasetyo = head_ImamPrasetyo;
 while(bantu_ImamPrasetyo!=NULL)
 {
  hapus_ImamPrasetyo = bantu_ImamPrasetyo;
  bantu_ImamPrasetyo = bantu_ImamPrasetyo->next_ImamPrasetyo;
  delete hapus_ImamPrasetyo;
 }
 head_ImamPrasetyo = NULL;
 tail_ImamPrasetyo = NULL; 
}

Saya menggunakan program "Programmer's Notepad"

Link Download :

http://adf.ly/cU88N | DLLNC
http://adf.ly/cU8F6 | DLLNC (Terbalik)

| Diposting oleh Unknown di 20.24 | 0 komentar

Program Metode Sorting C++

Kebetulan saya dapat tugas dari kampus disuruh membuat metode Sorting yang didalamnya ada macam2 metode Sorting ersebut dan disuruh digabung menjadi satu. saya akan share tugas tersebut sebagai pembelajaran kawan-kawan. Mohon kritik dan penilaiannya ya ^_^

"Saya menggunakan Programmer's Notepad"

Download Link :

http://adf.ly/cT8Mc | File Word
http://adf.ly/cT8ZY | File .cpp

Mengenal IT

Replace Tulisan Pada Coding Secara Sekaligus

Program Komplit Double Linked List Circular C++

Program Double Linked List Non Circular C++

Program Metode Sorting C++

Archivo del blog

Mengenai Saya

Belajar C++