ehillanieljayit123.blogspot.com
it123: March 2009
http://ehillanieljayit123.blogspot.com/2009_03_01_archive.html
Sunday, March 22, 2009. From Wikipedia, the free encyclopedia. That puts elements of a list. In a certain order. The most-used orders are numerical order and lexicographical order. Is important to optimizing the use of other algorithms (such as search. Algorithms) that require sorted lists to work correctly; it is also often useful for canonicalizing. Data and for producing human-readable output. More formally, the output must satisfy two conditions:. The output is a permutation. Main article: Bubble sort.
ehillanieljayit123.blogspot.com
it123: IT 123A-Double Ened
http://ehillanieljayit123.blogspot.com/2009/02/concept-double-ended-linklist-programer.html
Thursday, February 12, 2009. Double-Ended LinkList- it is a first and last reference. It can be thearrangement of such qualities in every inputs that are available. (wiki,google). Programer: Niel Jay F. Ehilla. Purpose: To know about Double-Ended LinkList. Private int idata;. Private long ddata;. Public Link (int nidata, long nddata){. Return(first& last= null);. Public void insertFirst(int nidata, long nddata){. Link newLink=new Link(nidata, nddata);. Public void insertLast(int nidata, long nddata){.
ehillanieljayit123.blogspot.com
it123: February 2009
http://ehillanieljayit123.blogspot.com/2009_02_01_archive.html
Tuesday, February 24, 2009. A queue (pronounced /kjuː/) is a particular kind of collection. In which the entities in the collection are kept in order and the principal (or only) operations on the collection are the addition of entities to the rear terminal position and removal of entities from the front terminal position. This makes the queue a First-In-First-Out (FIFO) data structure. 1] (google.com) http:/ en.wikipedia.org/wiki/Queue (data structure. Http:/ www.google.com.ph/search? Private int idata;.
ehillanieljayit123.blogspot.com
it123: IT 123A-Queue
http://ehillanieljayit123.blogspot.com/2009/02/concept-queue-pronounced-kju-is.html
Tuesday, February 24, 2009. A queue (pronounced /kjuː/) is a particular kind of collection. In which the entities in the collection are kept in order and the principal (or only) operations on the collection are the addition of entities to the rear terminal position and removal of entities from the front terminal position. This makes the queue a First-In-First-Out (FIFO) data structure. 1] (google.com) http:/ en.wikipedia.org/wiki/Queue (data structure. Http:/ www.google.com.ph/search?
ehillanieljayit123.blogspot.com
it123: IT 123A-Doubly Linked List
http://ehillanieljayit123.blogspot.com/2009/02/concept-doubly-linked-list-more.html
Tuesday, February 17, 2009. IT 123A-Doubly Linked List. A more sophisticated kind of linked list is a doubly-linked list or two-way linked list. Each node has two links: one points to the previous node, or points to a null. Value or empty list if it is the first node; and one points to the next, or points to a null. Value or empty list if it is the final node.[1](google.com)-( http:/ en.wikipedia.org/wiki/Linked list. Http:/ www.google.com.ph/search? Subscribe to: Post Comments (Atom).
ehillanieljayit123.blogspot.com
it123
http://ehillanieljayit123.blogspot.com/2009/03/programmer-niel-jay-f.html
Thursday, March 12, 2009. Programmer: Niel Jay F. Ehilla. Declaring a constructor of a list Queue. Public class Queue {. Public int entrynum;. Public String firstname;. Public String lastname;. Public char middlename;. Public Queue next;. Public Queue (int Enum, String Fname String Lname char M, ){. Displaying the elements on the list Queue. System.out.print(entrynum ” “ firstname ” “ ” “middlename “ “ : lastname). Private Queue first;. Private Queue last;. Checking if the list has elements or not.
ehillanieljayit123.blogspot.com
it123: IT 123A-Stack
http://ehillanieljayit123.blogspot.com/2009/02/it123a0809.html
Monday, February 2, 2009. Based on the principle of. Last In First Out. The stack method of expression evaluation was first proposed in 1955 and then patented in 1957 by early German computer scientist Friedrich L. Bauer. Abstract data type;. As an abstract data type. The stack is a container. And has two basic operations: push and pop.(google.com). A typical storage requirement for a stack of n elements is. N) The typical time requirement of. 1) operations is also easy to satisfy with a. Sp = sp.next.
ehillanieljayit123.blogspot.com
it123: Sorting Algorithm
http://ehillanieljayit123.blogspot.com/2009/03/sorting-algorithm.html
Sunday, March 22, 2009. From Wikipedia, the free encyclopedia. That puts elements of a list. In a certain order. The most-used orders are numerical order and lexicographical order. Is important to optimizing the use of other algorithms (such as search. Algorithms) that require sorted lists to work correctly; it is also often useful for canonicalizing. Data and for producing human-readable output. More formally, the output must satisfy two conditions:. The output is a permutation. Main article: Bubble sort.
