翻訳と辞書 Words near each other ・ Funnel ball ・ Funnel cake ・ Funnel chart ・ Funnel cloud ・ Funnel Cloud (album) ・ Funnel of Love ・ Funnel plot ・ Funnel Weaver (album) ・ Funnel Web ・ Funnel-web spider ・ Funnelback ・ Funnelbeaker culture ・ Funneliformis ・ Funneling ・ Funnell ・ Funnelsort ・ Funnelweb ・ Funnel–mantle locking apparatus ・ Funnies ・ Funnies (golf) ・ Funnies Inc. ・ Funnies on Parade ・ Funniest Pets & People ・ Funniest Show on Earth ・ Funniest Wins ・ Funningsfjørður ・ Funningur ・ Funningur Church ・ Funnsjøen ・ Funny (song) Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Funnelsort ： ウィキペディア英語版 Funnelsort Funnelsort is a comparison-based sorting algorithm. It was introduced by Frigo, Leiserson, Prokop, and Ramachandran in 1999 in the context of the cache oblivious model.〔M. Frigo, C.E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In ''Proceedings of the 40th IEEE Symposium on Foundations of Computer Science'' (FOCS 99), pp. 285-297. 1999. (Extended abstract at IEEE ), (at Citeseer ).〕〔Harald Prokop. (Cache-Oblivious Algorithms ). Masters thesis, MIT. 1999.〕 In the external memory model, the number of memory transfers it needs to perform a sort of $N$ items on a machine with cache of size $Z$ and cache lines of length $L$ is $O(\backslash frac\; \backslash log\_\; N)$, under the tall cache assumption that $Z\; =\; \backslash Omega(L^2)$. This number of memory transfers has been shown to be asymptotically optimal for comparison sorts. Funnelsort also achieves the asymptotically optimal runtime complexity of $\backslash Theta(N\; \backslash log\; N)$. == Algorithm == 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Funnelsort」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.