The built in array sorting algorithm (java.util.Arrays.sort) depends on the type of data being sorted. Primitive types are sorted with a modified implementation of quicksort. Objects are sorted with a modified implementation of mergesort.
There are many places where one could find advice about working with Java sorting arrays. The best place to learn more about working with Java would be to contact Oracle.
for arrays you can list the different arrays and what attributes that you give to them.
It is possible to use arrays when employing java programming language. There are many different series of programming choice that can be employed with various end results.
here you will a good example on java sorting algorithm application http://javacodespot.blogspot.com/2010/08/java-sorting-animations.html http://javacodespot.blogspot.com/
Strings and Arrays are two totally different data types in Java and they will not match with one another.
You can also use the Collections.sort() method to sort values in an array list. You can also use the Comparable Interface or Comparators for providing custom implementations of sorting algorithms for values inside an ArrayList.
// the build in sorting functions in Java will sort pretty much any array // of Comparable objects or primitives Arrays.sort(someArray);
JAVA
I assume you mean that you have a number of rows, and that not all rows have the same number of "cells". Yes, in Java a two-dimensional array is implemented as an array of arrays (each item in the top-level array is, in itself, an array); a 3-dimensional array is an array of arrays of arrays, etc.; and there is no rule stating that all secondary (etc.) arrays must have the same number of elements.
Better for what? Arrays have their purposes, other constructs have other purposes. Depending on what you need, an array may be just what you need.
Write a program that graphically demonstrates the shortest path algorithm
Java does not support associative arrays. However, you can achieve the same thing using a map.