| Selasa, 26 Mei 2009 |
| Double LinkedList |
?html>
?head>
?title>Struktur Data Linked List?/title>
?/head>
?body>
?script language = "JavaScript">
?!--
function LinkedList()
{
this._panjang = 0;
this._kepala = null;
}
LinkedList.prototype =
{
constructor: LinkedList,
//Membuat Metode untuk Menambah Data Kedalam List
Tambah: function (data)
{
//Membuat Node List
var node = {data: data, next: null}, NodeTanda;
//Periksa Isi List
if (this._kepala === null)
{
this._kepala = node;
}
else
{
NodeTanda = this._kepala;
while (NodeTanda.next)
{
NodeTanda = NodeTanda.next;
}
NodeTanda.next = node;
}
this._panjang++
},
//Membuat metode Untuk Menunjuk Item Data
Item: function (index)
{
if (index > -1 && index ? this._panjang)
{
var NodeTanda = this._kepala,
i = 0;
while (i++ ? index)
{
NodeTanda = NodeTanda.next;
}
return NodeTanda.data;
}
else
{
return null;
}
},
//Membuat metode Untuk Membuang Elemen List
Buang: function (index)
{
if (index > -1 && index ? this._panjang)
{
var NodeTanda = this._kepala, previous, i = 0;
if (index === 0)
{
this._kepala = NodeTanda.next;
}
else
{
while (i++ ? index)
{
previous = NodeTanda;
NodeTanda = NodeTanda.next;
}
previous.next =NodeTanda.next;
}
this._panjang--;
return NodeTanda.data;
}
else
{
return null;
}
},
//Membuat metode Untuk Mengetahui Jumlah Elemen List
Ukuran: function()
{
return this._panjang;
},
//Membuat metode Untuk Membentuk Array
toArray: function()
{
var result = [],
NodeTanda = this._kepala;
while (NodeTanda)
{
result.push (NodeTanda.data);
NodeTanda = NodeTanda.next;
}
return result;
},
//Membuat metode Untuk Konversi ke String
toString: function()
{
return this.toArray().toString();
}
}
var list = new LinkedList ();
list.Tambah("Teknik Informatika");
list.Tambah("Teknik Komputer");
list.Tambah("Komputerisasi Akuntansi");
list.Tambah("Komputer Networking");
document.write("Isi Linked List ?br>");
document.write("--------------- ?br>");
for (i=0; i?4; i++)
{
document.write(list.Item(i) + "?br>");
}
document.write("--------------- ?br>");
alert("Isi Linked List Awal =" +list.Item(0));
alert("Item 1 Pada Linked List dibuang, Yaitu =" +list.Item(1));
list.Buang(1);
document.write("Isi Linked List Terakhir ?br>");
document.write("---------------- ?br>");
for (i=0; i?4; i++)
{
document.write(list.Item(i) + "?br>");
}
document.write("---------------- ?br>");
//-->
?/script>
?/body>
?/html> |
posted by Abah Kemod,,, @ 20.05  |
|
|
|
| Selasa, 12 Mei 2009 |
| antrian1 |
<html>
<head>
<title> Program Queue dengan unshift javaScript </title>
<script Language="JavaScript">
function DataQueue()
{
var queue = [];
queue.unshift(1);
queue.unshift(2);
var i = queue.pop();
document.write(i + "<br/>");
queue.unshift(3);
queue.unshift(4);
var i = queue.pop();
document.write(i + "<br/>");
}
</script>
</head>
<body>
<form name="FormStrukturData">
<input name="btnQueue" value="Queue" type="button" onClick="DataQueue();" />
</form>
</body>
</html> |
| posted by Abah Kemod,,, @ 23.17 |
|
|
|
|
| antrian2 |
var queue = new array();
function Masuk_Antrian(data){
queue.unshift(data);
}
function Keluar_Antrtian(){
var yang_keluar_antrian = queue.pop();
if (yang_keluar_antrian == 0)
return "Stack Sudah Kosong";
else
return yang_keluar_antrian;
}
function Dalam_Antrian(list){
list.options.length = 0;
for (var i = 0; i< queue.length; i++){
var data = new Option(queue[i]);
list.options[list.options.length] = data;
}
}
</script>
</head>
<body>
<form>
<input type=text name=textSimpan>
<input type=button value="masuk Antrian"
onClick='Masuk_Antrian(textSimpan.value);
textSimpan.value="";
Dalam_Antrian(Visualisasi);'>
<select name="Visualisasi" size=12>
<option>Isi Antrian....
</select>
<input type=text name=textAmbil size=20>
<input type=button value="Keluar Antrian"
onClik="textAmbil.value = Keluar_Antrian();
Dalam_Antrian(Visualisasi);">
</form>
</body>
</html>ersands & angle brackets need to be encoded.</em> |
| posted by Abah Kemod,,, @ 20.01 |
|
|
|
|
| About Me |
|
![]()
Name: Abah Kemod,,,
Home:
About Me:
See my complete profile
|
| Previous Post |
|
| Archives |
|
|
| Sidebar Section |
Lorem ipsum dolor sit amet, consectetuer adipiscing elit. Duis ligula lorem, consequat eget, tristique nec, auctor quis, purus. Vivamus ut sem. Fusce aliquam nunc vitae purus. |
| Links |
|
|
 |
|
