Selasa, 26 Januari 2010

Linked List In Data Structures

Flat Chain or Linked List is one form of data structure, containing a collection of data (nodes) arranged in connectionconnect, dynamic and limited.Linked List are connected with the help of a pointer variableEach data in Linked List called the node (node)which occupies a dynamic memory allocation and usually in the formstruct that consists of several fields.Linked List or Flat-chain can be illustrated asone unit train.The train consists of several cars, each of the car is called the formation of the data type (struct).In order for these cars can be linked to each other is neededat least a hook that is called as a pointer.After declaring data types and pointers on the list, then we will try to make a list (linked list) is not a single spin or a car. There are some operations that we can make on the list, including: add, delete and edit of these cars.The essence of Linked list is a process (add, edit, delete) from car / node and how to connect between the carriage / node is .....

Tree In Heap sort

In Heap Sort Tree2.1 Definition of HeapIs a data structure that meets the tree-shaped nature of the heap that is, if B is a child of A, then the value stored at node A is greater than or equal to the value stored at node B. This causes the element with the largest value is always located at the root position, and the heap is called a max heap. (If the comparison is diterbalikkan smallest element always at the root node, the heap is called the min heap). Therefore, the heap used to implement queue prioriti. Operations that are used for the heap are:• Delete-delete-max or min: remove the root node of a max or min heap.• Increase or decrease-key-key: change the value stored in a node.• Insert: add a value into the heap.• Merge: merge two heap to form a new heap which contains all the elements forming the heap. 


Graf In Data Structures

Graf is used to represent discrete objects
and the relationship between these objects.

Graf Types
Based on the presence or absence of a bracelet or double side on a graph,
then the graph is classified into two types:

1. Simple graph (simple graph).
Graph does not contain a bracelet and double-side is called
simple graph.

2. Graf-no simple (unsimple-graph).
Graph which contains the so-called dual or bracelet graph
not-simple (unsimple graph).

• Based on the number of nodes in a graph, then the general graph
can be classified into two types:

1. Graf finite (limited graph)
is a graph of the number of the knot, n, finite.

2. Graf an infinite (unlimited graph)
Graph of the number of the knot, n, no finite number of
called an infinite graph.

• Based on the orientation direction, the general graph in
distinguish the 2 types:

1. Non-directional graph (undirected graph)
Graph which side do not have direction orientation is called graph

2. Directed graph (directed graph or digraph)
Graph that each side is given the orientation direction is called a
as a directional graph.

Graf in its application:
Electrical circuits, chemical compounds of carbon Isomers etc..

Posting Lainnya:
Nihi Sumba Resort
The Brando Resort, Tahiti.
Royal Mansour, Marrakesh, Maroko.
The Peninsula Manila, Filipina.
Hotel Bel-Air, Los Angeles, Amerika Serikat.
Four Seasons Resort Sayan, Bali, Indonesia.
5 Resor Paling Eksklusif di Dunia

Info Lainnya:

Info Bisnis:

Mobile ads:

Tree In Data Structure

In Data Structures, Tree is one of the data structureshaped like a tree, which consists of attackseries node (node) of each node is berhubungan.Node-invektor.Setiap connect by a node can have 0 ormore child nodes (child). A node that has a child node in -call the parent node (parent). A child node has only oneparent node. By convention computer science, Tree growingdown, not like in the real world tree that grows up.Thus the child node will be described under the nodeinduknya.Node in the base of the tree is called the root node (the root),while the node is located at the tip of tree pyramid is calledleaf node (leaf).Binary Tree (Binary Tree)In the course of data structures, will be specifically studiedfinger on the binary tree. Binary tree is a tree thateach knot can only have a maximum of 2 (two)No child node lebih.Pada binary tree, generally twochild node is called the position, the left and right.Some terms in the binary tree:- Size (size): the total number of existing nodes in binary tree.- Depth (depth): the long path that connects anode to node until the very end of her child (leaf).Depth is often called height.Full Binary Tree (Full Binary Tree)is a binary tree each nodenya has 0 or 2 child nodes.Perfect Binary Tree(Binary Tree Perfect) is a binary tree of all nodes leafnyais at a depth of samadari root node. Also calledas a Complete Binary Tree (Complete Binary Tree)Almost Complete Binary Tree(Almost Complete Binary Tree) is a binary tree of each0 node nodenyadapat have children, or have left, or ifhas a right to have kiri.Tidak should have the right course.Implementation of programming, in this subject will be indiscussed for binary trees only. Initial assumption is that the datato be inserted in the node, an integer data type.


Heap Sort

The tree diagram in Heap Sort
Understanding Heap is a data structure that meets the tree-shaped nature of the heap that is, if B is a child of A, then the value stored at node A is greater than or equal to the value stored at node B. This causes the element with the largest value is always located at the root position, and the heap is called a max heap. (If the comparison is diterbalikkan smallest element always at the root node, the heap is called the min heap). Therefore, the heap used to implement the priority queue. Operations that are used for the heap are:

• Delete-delete-max or min: remove the root node of a max or min heap.
• Increase or decrease-key-key: change the value stored in a node.
• Insert: add a value into the heap.
• Merge: merge two heap to form a new heap which contains all the elements forming the heap.

.2 Heap Types

.2.1 Binary heap
is the heap created by using binary trees.

.2.2 Binomial heap
is the heap created by using the binomial tree.

Binomial tree is defined recursively if is:
• A binomial tree with height 0 is a single node
• A binomial tree with height k has a root node whose children are the roots of the binomial trees.

.2.3 Fibonacci Heap
Fibonacci heap is a collection of trees that form the minimum heap.
Trees in this data structure does not have a specific shape and in extreme cases this heap contains all the elements in a different tree or a single tree with a height advantage of
Fibonacci heap is a heap enough when combined with the combining of two lists of trees.

Heap Sort is a sorting algorithm based on comparative data, and selection are among the sort. Although slower than quick sort in most machines, but the heap sort has the advantages of the complexity of the algorithm in the worst case is n log n.
Heap sorting algorithm of this sort to sort the contents of an array of inputs by looking at the array input as a Complete Binary Tree (CBT). After the Complete Binary Tree (CBT) can be converted into a heap tree. After the Complete Binary Tree (CBT) is changed into a priority queue.
Heap sorting algorithm starts from building a heap of data collection to be ordered, and then delete the data that has the highest value and placing it in the end of the array which has been ordered. After moving the data with the largest value, the next process is to rebuild the heap and move the greatest value on the heap and put it in last place in the sorted array of other data not specified. This process is repeated until no more data left in the heap and the sorted array is full. In our implementations require two arrays - one to store the heap and one for storing data that is sorted. But for memory optimization, we can use only one array only. That is the way to exchange the contents of the root with the last element in the heap tree. If the memory is not a problem it can be fixed using two rows of input array and the array results.
Heap Sort enter input data into a heap data structure. Greatest value (the max-heap) or the smallest value (in min-heap) is taken one by one until the end, the value is taken in the ordered sequence.
The algorithm for heap sort:
heapSort function (a, count) is
Input: an array is not sorted a long length with
(first place in a max-heap) heapify (a, count)
end: = count -1
0 do" onmouseover="'#ebeff9'" onmouseout="'#fff'">while end> 0 do
remove ()
reheapify ()
end: = end - 1

Algorithm Heapify
Heapify algorithm is to build a heap from the bottom up, successively changing down to build the heap. The first problem we must consider the operation of the heapify is where we must begin. When we try to roots heapify operations will occur runut-up operations like bubble sort algorithm that would cause the complexity of the existing time will double.
A different version is to build a heap in a top-down and turns up to be conceptually simpler to handle. This version begins with an empty heap and successively enter the data. Another version is to form a tree-lined heap heap-subtree starting from the bottom subtree. If the subtree-subtree of a node is formed from the heap then the tree node is easily made with a flow heap tree down.
Once tested, the most efficient idea is the final version, the complexity of the algorithm in the worst case is O (n), while the forming heap-heap tree tree from top to bottom its complexity O (n log n) Thus, the main algorithm heapify is doing an internal iteration starting from the bottom right node (the representation of the array, the elements in the largest index) to the root, then towards the left and climbed into the top level, and so on until reaching the root (as an array [0 .. N -1]). Therefore, the iteration is started from j = N / 2 and less one-one until it reaches j = 0. At the internal node, the examination is only done on the direct child node (not on the other levels below it). At the time iteration in a higher level, is always already formed subtreesubtree heap. Thus, the case will flow towards the bottom node. Thus, this version heapify do as much as N / 2 times iteration, and in the worst case would do as much iteration log (N) times.

Algorithm Remove
This algorithm remove the root switch (which contains the maximum value) of the heap with the last element. Logically, the nodes that are most kanabawah transferred to the roots to replace the root node to be taken.

Algorithm Reheapify
Reheapify algorithm is doing a remake the heap from top to bottom as well as the last iteration of the algorithm heapify methods. The difference between the methods heapify method on iteration reheapify by both the algorithm. The algorithm method was only doing reheapify last iteration of the algorithm heapify. This is because both the left subtree and right subtree is a heap, so no need for such a complete iteration algorithm heapify. And after reheapify the node that will be reduced next diiterasikan one.

Characteristics of the heap sorting algorithm is that the sort heap sort implementation using heap tree can be solved in order to heap sort. Therefore, to implement the sort heap sorting algorithm in an application program requires a dynamic allocation using a tree data structure (tree). The basic principles of tree data structure used to realize the heap tree is as follows:
a. Nodes are interconnected by using a pointer.
In this tree data structure is used at least two pointers in each node, each branch to point to the left and right branches of the tree. For example in C language, tree data structure is declared as follows:
Class BinaryTreeSimpul (
keyType key;
infoType info;
BinaryTreeSimpul Left,
Right; / / methods

b. Left and Right value NULL if no more branches in the corresponding direction.

c. The structure of the binary tree, including the relationships between nodes, are explicitly represented by the Left and Right. If required search up (backtrack), then it can be done with a scan of the root, the use of algorithms that are recursive, or use of the stack.

d. Another alternative is to add a pointer to the parent.
However, this will result in increasing the number of stages in the processes of addition / removal of nodes

COMPARISON WITH OTHER sorting algorithm
Heapsort almost equivalent to a quick sort, other data sorting algorithm based on a highly efficient comparison. Quick sort a bit faster, because the cache and other factors, but in the worst case
complexity O (n), which is very slow for data that are very large. Then because the heap sort has (N log N) is a system that requires strict security usually wear a heap sort algorithm pengurutannya. Heap sort is often compared with merge sort, which mempunyaikompleksitas the same algorithm, but its space complexity (n) larger than the heap sort. Heap sort is also faster on the machine data dengancache small or slow.

Taking advantage of the tree data structure, we can get the data sorting algorithm mangkus which can be used to build a good application programs. Sort heap sorting algorithm can be incorporated into the divide and conquer algorithm that caused the division performed by first applying the algorithm as an initialization heapify method to transform a tree into the heap tree, and at every stage of the algorithm is applied reheapify method to reorder the heap tree

Rabu, 20 Januari 2010

AW Surveys.....

AW Survey adalah web yang menyediakan berbagai macam survey yang mana setiap survey yang kita ikuti maka akan mendapat bonus.
silahkan coba AW kok.klik aja di gambarnya AW Survey

Rabu, 13 Januari 2010

Uang Dollar Dalam File ...???!!!

Dollar dalam media penyimpanan.
Pada situs Internet ada satu alamat web yang berfungsi untuk menyimpan file.
Jika file tersebut kita sharring dengan orang lain dan ada yang mendownload file ter sebut maka kita akan mendapat $0.001.
nama alamat nya adalah Ziddu.
Jika anda berminat mendaftar silahkan klik Url ini}PAU

Sabtu, 09 Januari 2010

Dollar in Pay Pal

PayPal is the faster, safer way to pay and get paid online - allowing its members to send and receive payments without disclosing financial information.

PayPal is an all-in-one solution that allows you the flexibility to pay or get paid using a variety of secure payment options, including account balances, bank accounts (in approved countries), credit cards or promotional financing. With more than 78 million active accounts1 in 190 markets and 24 currencies around the world, PayPal helps you to enable global ecommerce for your purchases and your business.

In the UK and Australia, PayPal is the most preferred payment service on the Web2. In the U.S., PayPal is one of the most preferred payment services on the Web.

PayPal was founded in 1998 and was acquired by eBay in 2002. Its main headquarters is located in San Jose, California. In 2007, PayPal established its international headquarters and technology development centre in Singapore (as PayPal Private Ltd.).

PayPal’s total payment volume, the total value of transactions in 2008 represented nearly 9 percent of global e-commerce.3

PayPal Pte Ltd is currently regulated as a Stored Value Facility (SVF) under Singapore law, is required to comply with the Payment Systems Oversight Act issued by the Monetary Authority of Singapore (MAS).

Consumer advisory - PayPal Pte. Ltd., the holder of PayPal's stored value facility, does not require the approval of the Monetary Authority of Singapore. Users are advised to read the terms and conditions available at carefully before use.

1Active accounts are those that have had activity in the past 12 months

2Source: PayPal Brand Tracker Q4 08 and Nielsen Consumer Report 2H 2008

3 Based on Forrester estimates of US e-commerce with the addition of eBay Inc. internal metrics totalling $256B

People String

Welcome to PeopleString! It's easy to get started!

For those of you who are new, follow the instructions to get acquainted with the site. For the older members, feel free to share this with your newbies to help them out a little.

Welcome to PeopleString!It’s easy to get started!

1. Sign in to your people string account using your ID and password

2. Make PeopleString your home page

3. Insider tip: Try to log on to your PeopleString account at least a few times a day. You will see your people points accumulate faster when you do!

4. Then click on MAILBOX-CASHBOX in the lower middle of your homepage, follow the instructions and take the survey so you can get an immediate $1.50 credit and start building people points!

5. Next, on the left you will see MY MAIL click on the email you currently have (PeopleString, BigString, yahoo, Gmail, MSN, AOL) it takes you directly to your email account sign in page. Use your email as you normally would. You are now earning money every time you use this portal to get your email!

6. PeopleString email is simple and easy to use. If you have questions contact

7. Also on the left you will see SOCIAL NETWORKS click on the social network site you want to go to (PeopleString, twitter, Facebook or my space) it will take you directly to the social network site. Use the site as you normally would. You are now earning money every time you use this portal to go to your social network!

8. If you use instant messaging below Social Networks you will see INSTANTMESSAGING. Simply click on the IM service you want to use (MSN, Yahoo, AIM or Gtalk) and use like you normally would. You are now earning money every time you use your PeopleString portal to use IM!

9. Want to earn some quick cash? Click on Make Some Cash in the PEOPLE DOLLARS box on the upper left of your home page.

10. Also you get points for using the Google search in the upper middle of the page.

11. This is a cool feature that people are using. You get cash rebates for shopping at thousands of stores. Here is an idea that people are using. Purchase a gift card from whatever stores you shop at. For example: go to Wal-Mart through the SHOPPING REBATE on the lower left of your homepage purchase a gift card and you get a 2% cash rebate for buying the gift card through your PeopleString portal. Right now Target is giving a 4% rebate!


13. Pass it on by sending everyone to your site to sign up so they can start making money and you can make even more money. Free members earn 5% of their direct referrals earnings and 2% of all earnings on levels 2 through 6. Entrepreneur members earn 20% of their direct referrals earnings and 6% of all earnings on levels 2 through 6. Which means Free members get .50 for everyone who signs up through their site and entrepreneurs get $40.00. You can upgrade to entrepreneur for $200.00 anytime. Also you make from 2% free members -6% entrepreneurs of everything they do. (Mailbox-Cashbox, shopping, people dollars)

Uang Dalam Revolusi Web

Uang di Bisnis online....
Bagi Anda yang ingin mengembangkan jaringan dan pertemanan sambil mencoba mendapatkan penghasilan dari kegiatan ini di dunia internet tidak ada salahnya anda mencoba sistem di bawah ini karena banyak keuntungan yang ditawarkan :

1. Modal 100% Gratis
2. Full Automatic system
3. Water Flow Randomizer
Sistem inilah yang bekerja memberikan keuntungan bagi Anda tanpa henti 24 jam penuh selamanya. Saat ada pengunjung akan mendaftar dan memasuki website TANPA SPONSOR, Maka Otomatis Sistem akan melakukan Randomizer (pengacakan) terhadap Seluruh Member untuk dijadikan sponsor / Upline. Sistem randomizer akan mendahulukan member yang belum punya downline atau punya downline paling sedikit, serta jika terdapat beberapa member yang sama-sama belum punya downline maka sistem akan memilih member yang join paling dahulu untuk dijadikan Sponsor.
Ibarat Aliran Air (water flow), maka randomizer ini akan mengalir kebawah dulu.

4. Water Flow Spill Over
Saat Matrix dari member terpenuhi (Telah mencapai 10 Downline) maka (Kelebihan) Downline berikutnya Secara otomatis, sistem akan melakukan Spill Over (limpahan) kebawah jaringannya. Sistem akan menelusuri jaringan yang belum mendapat downline sama sekali atau yang mempunyai downline paling sedikit untuk diberi Spill Over (limpahan). Jika jaringan sama-sama masih belum punya downline atau jumlah downlinenya sama, maka sistem akan mencari yang Join terlebih dahulu pada web ini untuk diberi Spill Over. Ibarat Aliran Air (water flow), maka Spill Over ini akan mengalir kebawah dulu.

5. Full Report system
Anda bisa memantau seluruh perkembangan anda di Program ini melalui Member Area, yang meliputi :
a. Jumlah downline yang sudah Anda peroleh hingga Level 7 dibawah anda
b. Jumlah Total KOMISI Tiap LEVEL
c. Jumlah KOMISI yang sudah Anda Ambil
d. Jumlah KOMISI yang Belum Anda Ambil
6.Fair System
Siapa yang bekerja dan berusaha lebih keras, akan mendapatkan hasil lebih banyak dalam waktu yang lebih singkat, tidak hanya menguntungkan member yang bergabung terlebih dahulu, oleh karenanya jangan ragu-ragu untuk segera bergabung untuk menjadi Succsess Business Online dalam program ini dan ciptakan MESIN PENGHASIL UANG yang akan membanjiri rekening bank Anda. Disamping itu pula program ini mengutamakan kejujuran dan kebersamaan dalam menjalankan bisnis ini, sehingga tidak terjadinya kecurangan yang dapat merugikan member – member lainnya.

7. Potensi Income mencapai 227 juta lebih
8. Bonus langsung Berbagai EBOOK berkualitas tinggi
9. Sebuah Virual Office Pribadi ( Member Area )
10. Informasi Bisnis Gratis & Sumber Uang lainnya
11. URL pribadi :
Jika Anda bergabung, maka Anda berhak mendapatkan website replika/URL yang berfungsi untuk mengembangkan jaringan Anda, dimana siapapun yang bergabung melalu URL tersebut secara otomatis akan menjadi DOWNLINE Anda.

Bagi yang berminat silahkan klik;
Bagi yang ingin belajar bisnis online silahkan klik :


Bisnis online dan cara untuk memulainya...

Begitu banyak yang ditawarkan oleh para pengiklan tentang bisnis online yang memang sedang marak akhir akhir ini.. Tapi kadang kita bingung untuk memulainya. Saya mempunyai beberapa tips mudah mudahan dapat berguna untuk anda sekalian, untuk kita yang pemula dan dalam tahap ingin mengetahui seperti apakah bisnis online di Internet itu ? 
alangkah baiknya jika kita memulai dengan ikut bergabung dengan bisnis online yang gratis seperti beberapa link yang ada di blog ini,sehingga kita tidak mempunyai resiko apapun. 

Sambil kita mengamati dan mempelajari apa yang menjadi aturan mainnya. Sebetulnya kunci utama dari bisnis di internet adalah seberapa banyak kita mempunyai teman, dan seberapa banyak kita melakukan promosi atas bisnis yang kita lakukan. Kedua hal ini menjadi poin penting dalam kita berbisnis. 

Apakah Bisnis online di Internet....

Sebesar apakah potensi bisnisnya..? 
Seperti yang telah saya tulis didalam posting. Internet adalah suatu jaringan komunikasi global. Sehingga yang dinamakan global adalah sesuatu yang menyeluruh tanpa batasan negara. Sehingga otomatis jika kita melakukan penyebaran informasi melalui internet akan berdampak Global pula. 

Dapatkah kita membayangkan sebuah potensi yang sunguh fantastis. Bayangkan dengan jumlah penduduk dunia saat ini. Dari gambaran gambaran diatas sehingga kita dapat berimajinasi bagaimana masa depan bisnis ini ? Mengapa kita tidak memulainya dari sekarang..!

Cara Sukses Menjawab Pertanyaan Wawancara Kerja
5 Tips Sukses Mark Zuckerberg
9 Kebiasaan Menyegarkan Otak
Delapan besar orang  kaya mendadak karena Google AdSense
Cara Belajar Sendiri Efektif dan Efesien Sukses !

Bisnis on line apa itu..?

Bisnis adalah suatu usaha yang dilakukan untuk memenuhi kebutuhan hidup sehari hari. Banyak orang yang melakukan bisnis ini banyak yang gagal tetapi banyak juga yang berhasil. sebagian yang gagal mengatakan bahwa bisnis adalah suatu pekerjaan yang sulit, sehingga mereka memilih bekerja saja, lebih aman. Lalu bagaimana dengan yang berhasil dengan bisnisnya tentu saja mereka akan berkata bahwa bisnis itu menyenangkan dan tentunya mereka tidak akan mau bekerja pada orang lain. 

Dalam memulai sebuah bisnis diperlukan wawasan tentang bisnis itu sendiri, Sebelum kita terjun kedunia bisnis sebaiknya kita mencari informasi tentang bisnis, terutama dengan bidang yang akan kita kerjakan. Semakin kita mengenal bisnis yang akan kita lakukan akan semakin baik,disampuing kita pun harus memiliki skill, disiplin dan keuletan, pantang menyerah dalam melakukannya. Semoga dengan bekal semua itu dapat mempunyai wawasan yang baru...

Cara Sukses Menjawab Pertanyaan Wawancara Kerja
5 Tips Sukses Mark Zuckerberg
9 Kebiasaan Menyegarkan Otak
Delapan besar orang  kaya mendadak karena Google AdSense
Cara Belajar Sendiri Efektif dan Efesien Sukses !

Bisnis on line Potensi dari internet

Uang dalam Internet...
Dalam sebuah jaringan Global telekomunikasi tentunya sangat memudahkan kita untuk berkomunikasi antara satu dengan yang lainnya.

Dengan kemajuan teknologi komputer saat ini yang begitu pesat,sehingga informasi dapat dikirim hanya dalam hitungan detik.

Ditambah untuk saat ini informasi begitu terbuka dapat diakses oleh semua orang. Semua itu sangat memudahkan bagi kita untuk melakukan bisnis terutama mempromosikan produk produk baru,Saling bertukar informasi. Semua itu membuat Internet mempunyai potensi yang sangat besar dalam dunia bisnis masa kini.

Cara Sukses Menjawab Pertanyaan Wawancara Kerja
5 Tips Sukses Mark Zuckerberg
9 Kebiasaan Menyegarkan Otak
Delapan besar orang  kaya mendadak karena Google AdSense
Cara Belajar Sendiri Efektif dan Efesien Sukses !


Related Posts Plugin for WordPress, Blogger...


Info Promo