in programming there are many different sets and types of data that the system can be manipulated with the help of which the programmer can organize process information.
data types in programming languages
It is an integral part of most programming languages, which describes the size and characteristics of data stored in a specific memory location, which ensures correct operation of the program in the process of implementation by a prescribed operation.
For example, one of the fundamental data types are integer variables.They can be both signed and vice versa, as the name already transmits the contents of a cell of this kind.
addition to integer variables, there are analogues of floating point, which are used to represent real value.Finally, the so-called primitive data types are string and character variables and pointers.All together it is an isolated language unit.
higher levels of organization in programming is considered to combine several units of the primitive data type into a more complex structure.Among the most common types of composites are considered the so-called Java-arrays.You can also select lists, tuples, stacks and queues.
main difference of arrays is that they provide random access to its elements.However, the difficulty lies in the fact that the amount should be possible to accurately indicate the initialization phase structure.This disadvantage is eliminated in a more complex data types, such as lists.Such systems have the ability to dynamically grow with the addition of new elements, but access to the data in them is longer.
In most modern programming languages, all these structures are present and play a crucial role in the functioning of both applications and the ecosystem itself.And Java - is no exception.
programming language Java.Main unit
Java is a strongly typed programming language bytecode that runs inside a virtual machine that allows you to perform operations and get the same result, regardless of computer architecture and operating systems.
The latest release of the Java language has eight primitive types: logical boolean, integer byte, integer, short, long, kind of floating point numbers represented float and double character and char.
Java-array is a collection of one type of data located in the memory of each other and having a sequence number (index) by which a programmer or system can access individual items stored in the array.Numbering in the index starts from zero (the first element) and is incremented by one for each subsequent.In this array provides the Java-random access - user code can access any element of the array, regardless of its location within the structure.
Do not forget that Java - is primarily object-oriented programming language.Therefore, these elements are an integral part of the memory model.A feature of systems of this type are that the Java-arrays can store objects in the same way as they store primitive data types.The most common object is a string in the language.They represent the character sets, organized into a single and unalterable memory cell.
array of strings Java is an ordered set of pointers to other memory areas, each of which is stored the desired object.Required user receives a set of symbols, so from a remote location in the memory of the virtual machine and running with it indirectly.
two-dimensional arrays (matrices)
This phenomenon, as the matrix is a two-dimensional array of Java-objects or primitives, organize them on a "number of the column."This data structure is sometimes described as an "array of arrays".This is due to the fact that each row or column are elements of a conventional Java-dimensional array, and their combination of a matrix.
The two-dimensional embodiment each vector may have its own length different from the others.When referring to a single element of the array uses two indexes to indicate the location desired memory.First - this is the line number in which the desired object is located.The second index - a column number, or the serial number of the element in the vector.Indexing elements within the two-dimensional structures starting from scratch, as in the case with one-dimensional arrays.Therefore, to refer to the last element of an array of length N characters will be used by the index of [N-1].
most common tasks when working with arrays is precisely the sort.This trivial at first glance, the task is much more complicated as the number of elements in a vector or matrix.
There are many different algorithms for sorting elements within a particular structure - a method bubble, selection sort, merge, or the method of sample insertion.All the methods differ in the speed of the task and the amount of memory needed to store additional temporary data and results obtained during the intermediate operations.
Some algorithms may have different optimal ratio depending on the input data set.In Java, the array sorting can be done by means of a standard auxiliary class Arrays, which has a static method sort, sorts the items in ascending and using fast sampling method.However, the algorithm is unstable, and the execution time may differ even in the processing of arrays of the same length.This sort is known as quickly ordered large random lists.Programmers are also available all the funds for the implementation of any other sorting algorithm in accordance with the parameters of the problem, and results requirements.