📄 datastructures.sort.html
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
<!--NewPage-->
<html>
<head>
<!-- Generated by javadoc on Sun Sep 27 09:53:41 EDT 1998
-->
<title>
Class DataStructures.Sort
</title>
</head>
<body>
<a name="_top_"></a>
<pre>
<a href="packages.html">All Packages</a> <a href="tree.html">Class Hierarchy</a> <a href="Package-DataStructures.html">This Package</a> <a href="DataStructures.SeparateChainingHashTable.html">Previous</a> <a href="DataStructures.SplayTree.html">Next</a> <a href="Index.html">Index</a> </pre>
<hr>
<h1>
Class DataStructures.Sort
</h1>
<pre>
java.lang.Object
|
+----DataStructures.Sort
</pre>
<hr>
<dl>
<dt>public final class <b>Sort</b>
<dt>extends Object</dl>
A class that contains several sorting routines,implemented as static methods.Arrays are rearranged with smallest item first,using compareTo.
<p>
<hr>
<a name="index"></a><h2>
<img src="images/constructor-index.gif" width=275 height=38 alt="Constructor Index">
</h2>
<dl>
<dt><img src="images/yellow-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#Sort()"><b>Sort</b></a>()
<dd>
</dl>
<h2>
<img src="images/method-index.gif" width=207 height=38 alt="Method Index">
</h2>
<dl>
<dt><img src="images/green-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#heapsort(DataStructures.Comparable[])"><b>heapsort</b></a>(Comparable[])
<dd>Standard heapsort.
<dt><img src="images/green-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#insertionSort(DataStructures.Comparable[])"><b>insertionSort</b></a>(Comparable[])
<dd>Simple insertion sort.
<dt><img src="images/green-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#main(java.lang.String[])"><b>main</b></a>(String[])
<dd>
<dt><img src="images/green-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#mergeSort(DataStructures.Comparable[])"><b>mergeSort</b></a>(Comparable[])
<dd>Mergesort algorithm.
<dt><img src="images/green-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#quickSelect(DataStructures.Comparable[], int)"><b>quickSelect</b></a>(Comparable[], int)
<dd>Quick selection algorithm.
<dt><img src="images/green-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#quicksort(DataStructures.Comparable[])"><b>quicksort</b></a>(Comparable[])
<dd>Quicksort algorithm.
<dt><img src="images/green-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#shellsort(DataStructures.Comparable[])"><b>shellsort</b></a>(Comparable[])
<dd>Shellsort, using Shell's (poor) increments.
<dt><img src="images/green-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#swapReferences(java.lang.Object[], int, int)"><b>swapReferences</b></a>(Object[], int, int)
<dd>Method to swap to elements in an array.
</dl>
<a name="constructors"></a><h2>
<img src="images/constructors.gif" width=231 height=38 alt="Constructors">
</h2>
<a name="Sort"></a><a name="Sort"></a><a name="Sort()"><img src="images/yellow-ball.gif" width=12 height=12 alt=" o ">
</a><b>Sort</b>
<pre>
public Sort()</pre>
<dl>
</dl>
<a name="methods"></a><h2>
<img src="images/methods.gif" width=151 height=38 alt="Methods">
</h2>
<a name="insertionSort"></a><a name="insertionSort(DataStructures.Comparable[])"><img src="images/green-ball.gif" width=12 height=12 alt=" o ">
</a><b>insertionSort</b>
<pre>
public static void insertionSort(<a href="DataStructures.Comparable.html">Comparable</a>[] a)</pre>
<dl>
<dd>Simple insertion sort.
<p>
<dd><dl>
<dt><b>Parameters:</b>
<dd>a - an array of Comparable items.
</dl>
</dd>
</dl>
<a name="shellsort"></a><a name="shellsort(DataStructures.Comparable[])"><img src="images/green-ball.gif" width=12 height=12 alt=" o ">
</a><b>shellsort</b>
<pre>
public static void shellsort(<a href="DataStructures.Comparable.html">Comparable</a>[] a)</pre>
<dl>
<dd>Shellsort, using Shell's (poor) increments.
<p>
<dd><dl>
<dt><b>Parameters:</b>
<dd>a - an array of Comparable items.
</dl>
</dd>
</dl>
<a name="heapsort"></a><a name="heapsort(DataStructures.Comparable[])"><img src="images/green-ball.gif" width=12 height=12 alt=" o ">
</a><b>heapsort</b>
<pre>
public static void heapsort(<a href="DataStructures.Comparable.html">Comparable</a>[] a)</pre>
<dl>
<dd>Standard heapsort.
<p>
<dd><dl>
<dt><b>Parameters:</b>
<dd>a - an array of Comparable items.
</dl>
</dd>
</dl>
<a name="mergeSort"></a><a name="mergeSort(DataStructures.Comparable[])"><img src="images/green-ball.gif" width=12 height=12 alt=" o ">
</a><b>mergeSort</b>
<pre>
public static void mergeSort(<a href="DataStructures.Comparable.html">Comparable</a>[] a)</pre>
<dl>
<dd>Mergesort algorithm.
<p>
<dd><dl>
<dt><b>Parameters:</b>
<dd>a - an array of Comparable items.
</dl>
</dd>
</dl>
<a name="quicksort"></a><a name="quicksort(DataStructures.Comparable[])"><img src="images/green-ball.gif" width=12 height=12 alt=" o ">
</a><b>quicksort</b>
<pre>
public static void quicksort(<a href="DataStructures.Comparable.html">Comparable</a>[] a)</pre>
<dl>
<dd>Quicksort algorithm.
<p>
<dd><dl>
<dt><b>Parameters:</b>
<dd>a - an array of Comparable items.
</dl>
</dd>
</dl>
<a name="swapReferences"></a><a name="swapReferences(java.lang.Object[], int, int)"><img src="images/green-ball.gif" width=12 height=12 alt=" o ">
</a><b>swapReferences</b>
<pre>
public static final void swapReferences(Object[] a, int index1, int index2)</pre>
<dl>
<dd>Method to swap to elements in an array.
<p>
<dd><dl>
<dt><b>Parameters:</b>
<dd>a - an array of objects.
<dd>index1 - the index of the first object.
<dd>index2 - the index of the second object.
</dl>
</dd>
</dl>
<a name="quickSelect"></a><a name="quickSelect(DataStructures.Comparable[], int)"><img src="images/green-ball.gif" width=12 height=12 alt=" o ">
</a><b>quickSelect</b>
<pre>
public static void quickSelect(<a href="DataStructures.Comparable.html">Comparable</a>[] a, int k)</pre>
<dl>
<dd>Quick selection algorithm.Places the kth smallest item in a[k-1].
<p>
<dd><dl>
<dt><b>Parameters:</b>
<dd>a - an array of Comparable items.
<dd>k - the desired rank (1 is minimum) in the entire array.
</dl>
</dd>
</dl>
<a name="main"></a><a name="main(java.lang.String[])"><img src="images/green-ball.gif" width=12 height=12 alt=" o ">
</a><b>main</b>
<pre>
public static void main(String[] args)</pre>
<dl>
</dl>
<hr>
<pre>
<a href="packages.html">All Packages</a> <a href="tree.html">Class Hierarchy</a> <a href="Package-DataStructures.html">This Package</a> <a href="DataStructures.SeparateChainingHashTable.html">Previous</a> <a href="DataStructures.SplayTree.html">Next</a> <a href="Index.html">Index</a> </pre>
</body>
</html>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -