Functional

Name

Note

To do parallel computing, for multi-processors / multi-core architecture;

MSDN Barrier;

MSDN BlockingQueue;

MSDN BoundedBuffer;

MSDN CountdownLatch;

MSDN LockFreeStack;

MSDN Parallel.ForAll loop a.k.a. Partition Loop Tiling;

MSDN Reduce;

MSDN SpinWait;

MSDN ThinEvent;

Also see: Reduce in sysDevelopmentAnalysis.htm;

MSDN;

To access indexes

ISAM

In database, to index keys and pointers of records

Binary operator Count

Binary operator Max

Binary operator Min

Binary operator Sum

Also see: Aggregate function parameters, which might be opposite to manifold, because differentiable cannot define reduction;

Average is (x,y)=>new{x[0]+y, x[1]+1} where selection (x)=>x[0]/x[1]; Count is (x,y)=>x+1; Max is (x,y)=>x>y?x:y; Min is (x,y)=>x<y?x:y; Sum is (x,y)=>x+y;

To either queue or stack

DEQUE

Can apply LIFO, FIFO at both ends; Also see: enqueue, and then dequeue;

To find an element in a list

Hash Search

Hashing is efficient

To link nodes together

Tree

In tree, nodes can be classified 3 different categories – child node, parent node, and root node;

IFF numerological dimension, also see: C Sequence Number ... ;

To list

Linear List

To be in order linearly

To list elements

List

In any order, elements can be added to a list, or elements can be removed from a list; [List applies pointer. Therefore, multiple types of data can be grouped together as a whole, and then pointing to each wholes (data structure) becomes list.]

To list nodes

[Singly: A pointer to node where the node itself contains data-structure and then the pointer is assigned into another pointer which points the next node]

Linked List

[Doubly: A queue can be implemented, if an element of the queue is a pointer to an array, and then multiple arrays can be linked, but calculate the buffer for memory constraints – leaks can occur]

A pointer is needed for singly linked list; Two pointers are needed for doubly linked list

To queue in FIFO order

Queue

Elements in a queue become data structure

To represent a data

Element

An entity in a data set

To represent a Node

Root

The highest uppermost node of a tree

To represent data-elements in a record

Field

Each field stands for a data type, and different data types can be assigned into fields

To represent elements

Node

A location in a tree

To represent Node

Leaf

Node ≡ Leaf

End of a brunch is called Leaf;

IFF a curve terminates at both ends, also known as folium, and the IFF time, un-common Leaf behaves as loop;

To schedule events in time

Scheduling

One of the OS features;

System time oriented, and applied in timely events applications

To search

Binary Search

In heap, tail recursive consumes more memory space than embedded recursive search [pg. 144-145, Sethi, 1989]

The data-item to be searched should be known;

In software engineering, mem leak can occur, if not checking the possible recursive quantities. Because each recursive call takes mem space

To search elements

Tree Search

Branching by nodes provide path to find an element

To search sequentially

Linear Search

If a list is short, it is recommended to use, otherwise it will slow

To sort

Shell Sort

Created by Donald Shell;

To order data

To sort

Insertion Sort

Not recommended to sort arrays;

Recommended to sort linked lists

To sort

Merge Sort

Recommended to sort when numbers of sorted-lists merge into a sorted-list

To sort

Quick Sort

Efficient

To sort

Bubble Sort

Exchange sort to a list;

For example, Bubble Sort Sample, by Sun's Forte for Java, Community Edition v.1, 2000;

To sort

Binary Tree

Each node must contain an unique key

To sort

Heap Sort

Efficient; i.e. Repaginating by MS Office

To sort

Radix Sort

Same as Digital Sort; efficient

To sort

Digital Sort

Same as Radix Sort; LSB is sorted first

To stack in LIFO order

Stack; In Win OS, i.e. %PATH%\ipsec6 /? <enter>

Addresses of procedures, addresses of functions, variables and parameters are pushed and popped;

To store

FRAM

Record of data by magnetic-ferric oxide

To store database indexes

B Tree

In database, specified row or record can be found quickly by its index

To structure different kinds of data

Record

Data type of elements must not be the same like array

To structure same kinds of data

Array

Data type of elements must be the same; Also see: Static control array; Dynamic control array;

To transform

Hash

Between mapped numerical value into correspondent data

To use memory portion

[Lexical scope is not Microsoft standard, it is AT&T standard]

Heap

[If available, all buffers out of lexical scope must be checked before compilation]

Only in a run time, by blocks, by a program

To verify digital signature

SHA, Secure Hash Algorithm

Compute 160 bits to hash; also called Message Digest; To secure sender-receiver’s message or data

To multithread

Threaded Tree

i.e. after 5 is inserted, if the LEAF points to 70; after 70 is inserted, if the LEAF points to 9; after 9 is inserted, if the LEAF points to 81

If a leaf is a pointer, pointing to a node in a tree; Read  Diagram: Binary Search Tree, Insertion first;

2D 01 to sort [Think of C-Number 360˙ Tree here later how to relate to 2D Radix 2]

Your own sorting algorithm; Note for Asimo Ukon heuristic reasoning: searching without sorting can also be considered heuristic;

The fastest 2D radix 2 algorithm;

Create the 2D radix 2 algorithm, and prove that it is the fastest