Enter your email address:

    Delivered by FeedBurner

Operation Structure Data Array 1 Dimension


During the time we are only studying single data structure of its meaning of data input to be processed by output data and program as result of program process have the character of single (do not team). Though problems met by in field many data type which actually is identified precisely if kept with changer (variable) with data structure of array. Array is corps data which of a kind with the each its member element owning a number of index unique element.



Seeking Of Data (Searching)

Searching an or data of searching at a group of data which of a kind is an process which is often met by field. Principal of activity of method of searching this shall be as follows : comparing to start from data (first index) till data (last index) at changer of the array with searched data, is same if some mean process seeking of success or meet, but if until is same to last data nothing that mean seeking process fail or do not be found by such data.

Sequence Data (Sorting)

Other Process which do not less important and is often met by field is process sort data in an variable of array (in this case array 1 dimension). Data sequence there is two kinds of namely massage to go up (massage and ascending) go down (descending). In massage go up, data in array will be arranged to repeat with element which is its smallest value will be placed on course number of index first and element with biggest value will be placed on course number of index last. Principle of method at massage go down / descending : started from first data (element of array at number of index first) of array 1 dimension above as directive, compared to last of data both (element of array at number of index second), if data both first data, hence both the data commuted for so that both data becoming first data and first data become both data, hereinafter compared to first data again with third data (element of array at number of index third), if third data first data hence both commuted for, that way further till last data (element of array at number of index last) compared to of first data. Comparison continued with both data as its directive, and compared to third data and so on till last data. That way recurring algorithm continue till data of n – 1 (where n is the amount of element of array entirely).

Array is data structure which consist of a group of data which of a kind. Array there is which is 1 dimension and 2 dimension. One of the method of sorting easy for implementation is method of bubble sort modified.



During the time we are only studying single data structure of its meaning of data input to be processed by output data and program as result of program process have the character of single (do not team). Though problems met by in field many data type which actually is identified precisely if kept with changer (variable) with data structure of array. Array is corps data which of a kind with the each its member element owning a number of index unique element.



Seeking Of Data (Searching)

Searching an or data of searching at a group of data which of a kind is an process which is often met by field. Principal of activity of method of searching this shall be as follows : comparing to start from data (first index) till data (last index) at changer of the array with searched data, is same if some mean process seeking of success or meet, but if until is same to last data nothing that mean seeking process fail or do not be found by such data.

Sequence Data (Sorting)

Other Process which do not less important and is often met by field is process sort data in an variable of array (in this case array 1 dimension). Data sequence there is two kinds of namely massage to go up (massage and ascending) go down (descending). In massage go up, data in array will be arranged to repeat with element which is its smallest value will be placed on course number of index first and element with biggest value will be placed on course number of index last. Principle of method at massage go down / descending : started from first data (element of array at number of index first) of array 1 dimension above as directive, compared to last of data both (element of array at number of index second), if data both first data, hence both the data commuted for so that both data becoming first data and first data become both data, hereinafter compared to first data again with third data (element of array at number of index third), if third data first data hence both commuted for, that way further till last data (element of array at number of index last) compared to of first data. Comparison continued with both data as its directive, and compared to third data and so on till last data. That way recurring algorithm continue till data of n – 1 (where n is the amount of element of array entirely).

Array is data structure which consist of a group of data which of a kind. Array there is which is 1 dimension and 2 dimension. One of the method of sorting easy for implementation is method of bubble sort modified.



Recent Articles

Blog Archive