Searching pramana rwxr-xr-x 0 1:55 am

Filename	Searching
Permission	rw-r--r--
Author	pramana
Date and Time	1:55 am
Label
Action

                Searching is a process (operation) to find the location of the data given in a sequence of data.
Search data is often also called look-up table or information storage and retrieval, is a process to gather some information on the computer and then search for the reminder re the necessary information.

Any one method in searching
*sequential Searching

The simplest method of a number of search methods is the sequential search method (sequential searching). This method can be briefly described as follows:
Of the known elements, the data source than the one by one until the data is found or not found.

Sequential Algorithm Searching:
1. Read the set of known data, such as a set A with N elements.
2. Read data is searched, eg, Data
3. There = False
4. For I = 1 to N 5 step process

5. If Data = A [I] then
    There = True; Position = I; I = N
6. If There = False Then
     N = N +1; A [i] = data
7. completed

Sorting pramana rwxr-xr-x 0 8:34 pm

Filename	Sorting
Permission	rw-r--r--
Author	pramana
Date and Time	8:34 pm
Label
Action

Hi guys, this time I will share about Sorting ...Sorting is a process of arranging objects in a specific sequence and / or in different sets, and therefore he  has two different common meanings:

     1. ordering      : arranging similar objects, class, etc., in regular order.
     2. categorizing : grouping and labeling the objects with similar properties.

Sorting algorithm consists of several algorithms such as Bubble sort, Quick sort, Selection Sort, Insertion Sort, and Merge Sort are which each has a different type of sorting to each other.

On this occasion I will only discuss about the selection sort ..
Selection sort algorithm can be summarized as follows :

1. Find the minimum value (or sesuaikeinginan) in the data structure. If ascending, then that should be found is the minimum value. If descending, then find the maximum possible value.
2. Swap value is the value at posisipertama in the data structure that has not been sorted. 
3. Repeat the above steps for the remaining part of the data structure.

 

  

I HOPE THIS CAN HELP