English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 54059/88894 (61%)
造訪人次 : 10549639      線上人數 : 22
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/41565

    題名: Presorting algorithms : An average-case point of view
    其他題名: 排序演算法之先期處理: 以平均情形的觀點
    作者: 黃顯貴;Hwang, Hsien-kwei;楊柏因;Yang, Bo-yin;葉永南;Yeh, Yeong-nan
    貢獻者: 淡江大學數學學系
    關鍵詞: Presorting;Measure of presortedness (mop)
    日期: 2000-07-06
    上傳時間: 2010-01-28 07:50:05 (UTC+8)
    出版者: Elsevier
    摘要: We introduce the concept of presorting algorithms, quantifying and evaluating the performance of such algorithms with the average reduction in number of inversions. Stages of well-known algorithms such as Shellsort and quicksort are evaluated in such a framework and shown to cause a meaning drop in the inversion statistic. The expected value, variance and generating function for the decrease in number of inversions are computed. The possibility of “presorting” a sorting algorithm is also investigated under a similar framework.
    關聯: Theoretical Computer Science 242(1-2), pp.29-40
    DOI: 10.1016/S0304-3975(98)00181-9
    顯示於類別:[數學學系暨研究所] 期刊論文


    檔案 大小格式瀏覽次數



    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋