サクサク読めて、アプリ限定の機能も多数!
トップへ戻る
夏の料理
xlinux.nist.gov
absolute performance guarantee abstract data type (a,b)-tree accepting state Ackermann's function active data structure acyclic directed graph: see directed acyclic graph acyclic graph adaptive heap sort adaptive Huffman coding adaptive k-d tree adaptive sort address-calculation sort adjacency-list representation adjacency-matrix representation adjacent admissible vertex ADT: see abstract data typ
(algorithm) Definition: The best possible sort algorithm: it is so lucky that the input is already sorted, and it need do nothing! See also bogosort, bozo sort, stooge sort. Note: Defined more for humorous, rather than serious, purposes. Time complexity is Θ(0) (zero): it takes no time. Author: PEB Go to the Dictionary of Algorithms and Data Structures home page. If you have suggestions, correctio
(algorithm) Definition: Compare, and swap if necessary, pairs of elements in parallel. Subsets are sorted then merged. Also known as Batcher sort. Generalization (I am a kind of ...) oblivious algorithm. Note: This takes O((log n)2/2) stages (or steps) with n/2 comparators at each stage. This sorts increasingly larger intermingled subsets, somewhat like Shell sort, and merges subsets, like merge s
このページを最初にブックマークしてみませんか?
『xlinux.nist.gov』の新着エントリーを見る
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く