#include <stdio.h>
#include <conio.h>
#include <stdlib.h>
#define MAX 30
#define DELAY 10000000
#define TRUE 1
#define FALSE 0
#define INPUT 'i'
#define OUTPUT 'o'
#define _MY_DEBUG
#if defined(_MY_DEBUG)
#define TRACE_LINE printf("\n\n- Program Statistics...
Tuesday, November 29, 2011
Shell Sort dalam bahasa C
#
#include <stdio.h>
#include <conio.h>
#include <stdlib.h>
#define MAX 100
#define INPUT 'i'
#define OUTPUT 'o'
#define _MY_DEBUG
#if defined(_MY_DEBUG)
#define TRACE_LINE printf("\n\n- Program Statistics :\n1. File : %s\n2. Date : %s\n3. Time : %s\n",__FILE__,__DATE__,__TIME__);
#else
...
bucket Sort dalam bahasa C
#include <stdio.h>
#include <conio.h>
#include <stdlib.h>
#define MAX 100
#define INPUT 'i'
#define OUTPUT 'o'
#define _MY_DEBUG
#if defined(_MY_DEBUG)
#define TRACE_LINE printf("\n\n- Program Statistics :\n1. File : %s\n2. Date : %s\n3. Time : %s\n",__FILE__,__DATE__,__TIME__);
#else
...
Quick Sort dalam bahasa C
#include <stdio.h>
#include <conio.h>
#include <stdlib.h>
#define MAX 30
#define INPUT 'i'
#define OUTPUT 'o'
#define TRUE 1
#define FALSE 0
#define _MY_DEBUG
#if defined(_MY_DEBUG)
#define TRACE_LINE printf("\n\n- Program Statistics :\n1. File : %s\n2....
Exchange sort dalam bahasa C
#include <stdio.h>
#include <conio.h>
#include <stdlib.h>
#define MAX 30
#define DELAY 10000000
#define TRUE 1
#define FALSE 0
#define INPUT 'i'
#define OUTPUT 'o'
#define _MY_DEBUG
#if defined(_MY_DEBUG)
#define TRACE_LINE printf("\n\n- Program Statistics...
Gnome sort dalam bahasa C
#include <stdio.h>
#include <conio.h>
#include <stdlib.h>
#define MAX 100
#define INPUT 'i'
#define OUTPUT 'o'
#define _MY_DEBUG
#if defined(_MY_DEBUG)
#define TRACE_LINE printf("\n\n- Program Statistics :\n1. File : %s\n2. Date : %s\n3. Time : %s\n",__FILE__,__DATE__,__TIME__);
#else
...
Insertion Sort dalam bahasa C
#include <stdio.h>
#include <conio.h>
#include <stdlib.h>
#define MAX 30
#define DELAY 10000000
#define TRUE 1
#define FALSE 0
#define INPUT 'i'
#define OUTPUT 'o'
#define _MY_DEBUG
#if defined(_MY_DEBUG)
#define TRACE_LINE printf("\n\n- Program Statistics...
Counting Sort dalam bahasa C
#include <stdio.h>
#include <conio.h>
#include <stdlib.h>
#define UINT unsigned int
#define MAX 100
#define INPUT 'i'
#define OUTPUT 'o'
#define _MY_DEBUG
#if defined(_MY_DEBUG)
#define TRACE_LINE printf("\n\n- Program Statistics :\n1. File : %s\n2. Date...
procedure counting sort
Procedure CountingSort (Input/output T:array [1..N] of integer){Mengurutkan Tabel T integer [1..N] dengan pencacahan, dimana range atau rentang nilainya [1..k] dengan hasil akhir T terurut menaik , dengan asumsi:Nilai N (jumlah elemen T) dan k diketahui Asumsi : Nilai N...
program inheritance mobil dalam c#
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace ConsoleApplication27
{
class kendaraan
{
public kendaraan()
{
...
program inheritance handphone 2 dalam c#
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace inheritance
{
class Handphone
{
public string nama;
public void call()
...
program inheritance handphone dalam c#
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace inheritance
{
class Handphone
{
public void call()
{
...
Wednesday, November 23, 2011
Monday, November 21, 2011
penjualan tiket pesawat dalam pascal
Program menjual_tiket;
Uses wincrt;
Type mat = array[1..10,1..10] of integer;
Function free(a: mat): Boolean;
Var
I,j : integer;
found: boolean;
Begin
Found:= true;
I:= 1;
While (found) and (i<=8) do
...
program konversi desimal ke heksa dalam pascal
Program Convert_Decimal_To_heksa;
Uses wincrt;
Const N = 100;
Type Stack = record
Isi : Array[1..N]of integer;
Top : integer;
end;
Procedure CreateStack(Var S:Stack);
begin
...
program queue dalam pascal
Program Queveueeueueueueueueueuee;
Uses wincrt;
Const N = 100;
Type Queve = record
isi : Array[1..N]of integer;
head:integer;
tail: integer;
end;
Procedure CreateQueve(Var S:Queve);
...
mengubah desimal menjadi biner dalam pascal
program ubah_desimal_binary;
uses wincrt;
const n=100;
type stack = record
elemen:array[1..n]of integer;
top:integer;
end;
...
program matrik dalam pascal
program matiks;
uses wincrt;
type
arin=array [1..100] of integer;
function cari(b:arin;m,n,x:integer):integer;
var
i,j,domp:integer;
begin
domp:=0;
for i:=1 to m do
begin
for j:= 1 to n do
begin
if b[j]=x then
domp:=domp+1;
end;
end;
cari:=domp;
end;
var
a:arin;
i,j,m,n,x,domp:integer;
begin
write('masukan...
statistik (mean dan titik tengah) dalam pascal
Program interval;
uses wincrt;
type tabin=array [1..200] of integer;
function mean (a:tabin; n:integer):real;
var
i,domp:integer;
begin
domp:=0;
for i:= 1 to n do
domp:=domp+a[i];
mean:=domp/n;
end;
function ttktngah(a:tabin; n:integer):real;
begin
if n mod 2 = 0 then
ttktngah:=(a[n...
program warnet dalam pascal
program wartel;
uses wincrt;
type waktu=record
jam:longint;
menit:longint;
detik:longint;
end;
function hitungselisih(jam1,jam2:waktu):longint;
begin
hitungselisih:=((jam2.jam*3600)+(jam2.menit*60)+jam2.detik)-((jam1.jam*3600)+(jam1.menit*60)+jam1.detik);
end;
function...
program stack dalam pascal
program stackkkkk;
uses wincrt;
type stack=record
isistack:array [1..100] of integer;
top:integer;
end;
const n:integer=100;
procedure createstack(var s:stack);
begin
s.top:=0;
end;
function isfull(s:stack):boolean;
begin
isfull:=(s.top=n);
end;
function...
menghitung jumlah, perkalian dan rata-rata dalam pascal
program ulang;
uses wincrt;
type a=array[1..10000] of longint;
var
T:a;
n,temp,temp2,i,j:longint;
c:real;
begin
i:=1;
repeat
write('masukan angka = ');read(n);
T[i]:=n;
i:=i+1;
until (n>9999);
clrscr;
temp:=T[1];
write('penjumlahan = ',T[1],'+');
for j:=2 to (i-2) do
begin
write(T[j]);
temp:=temp+T[j];
if...
program warnet dalam pascal
program wartel;
uses wincrt;
type waktu=record
jam:longint;
menit:longint;
detik:longint;
end;
function hitungselisih(jam1,jam2:waktu):longint;
begin
hitungselisih:=((jam2.jam*3600)+(jam2.menit*60)+jam2.detik)-((jam1.jam*3600)+(jam1.menit*60)+jam1.detik);
end;
function...
Thursday, November 17, 2011
mencari nilai max min secara rekursif
Procedure rekursifmaxmin(input T[1..N] array of integer, i:integer, j:integer, output max,min:integer)
Kamus
T1,T2: array
min1,min2,max1,max2:integer
Algoritma
if i=j then
max <-- T[i]
min <-- T[i]
else
...
Wednesday, November 16, 2011
penjualan minuman dalam pascal
Program hitung;
uses wincrt;
const m:longint=5;
type barang=record
kode:longint;
nama:string;
harga:longint;
berat:longint;
stok:longint;
pembelian:longint;
...
Tuesday, November 15, 2011
program bank dalam c#
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace ConsoleApplication1
{
public class bank
{
private int amount;
private static int total;
...
Wednesday, November 9, 2011
mencari niali terkecil array 2 dimensi
program matiks;
uses wincrt;
type
tab=record
kolom:integer;
baris:integer;
bil:integer;
end;
type
arin=array [1..100] of integer;
procedure min(b:arin;m,n:integer;var c:tab);
var
i,j,domp,temp:integer;
begin
domp:=b[1];
c.baris:=1;
c.kolom:=1;
for i:=1 to m do
begin
for...
Subscribe to:
Posts (Atom)