Arrays

In programming, their are many different ways you must know to sort an array, and to search for an element in an array. This section will have different sorting/searching algorithms in java, with explanations. Examples include: bubble sort, quicksort, binary search, gnome sort, etc. Since sorting/searching does not require a javascript implementation, this section, unlike the "Math Functions" section will not have javascript on each page. Below is one javascript implementation just to demonstrate sorting. Note that java already has a stable nlog(n) sort inside their library, so if you really must sort, use their method, array.sort(), and can binary search as well, but these are used to give explanations on how they work and a real implementation of different sorts either for homework or interest.