{"created":"2025-01-18T23:01:35.878931+00:00","updated":"2025-01-22T16:07:57.992089+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00032533","sets":["1164:2592:2700:2703"]},"path":["2703"],"owner":"1","recid":"32533","title":["対称整列法：攪乱要因dに対しO（n* log （d））時間の整列法"],"pubdate":{"attribute_name":"公開日","attribute_value":"1992-07-17"},"_buckets":{"deposit":"9e43cf3e-385f-495e-a141-3ee1e6330274"},"_deposit":{"id":"32533","pid":{"type":"depid","value":"32533","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"対称整列法：攪乱要因dに対しO（n* log （d））時間の整列法","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"対称整列法：攪乱要因dに対しO（n* log （d））時間の整列法"},{"subitem_title":"SYMMETRIC SORT: AN O (n* log (d) ) SORT WHERE d IS A DISOBDERING FACTOR","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1992-07-17","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"早稲田大学理工学部 情報学科"},{"subitem_text_value":"早稲田大学理工学部 情報学科"},{"subitem_text_value":"早稲田大学理工学部 情報学科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Information and Computer Science School of Science and Engineering, Waseda University","subitem_text_language":"en"},{"subitem_text_value":"Department of Information and Computer Science School of Science and Engineering, Waseda University","subitem_text_language":"en"},{"subitem_text_value":"Department of Information and Computer Science School of Science and Engineering, Waseda University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/32533/files/IPSJ-AL92028008.pdf"},"date":[{"dateType":"Available","dateValue":"1994-07-17"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL92028008.pdf","filesize":[{"value":"1.1 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"7505c1bb-0678-4ec7-9064-bbb992b66917","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1992 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"二村, 良彦"},{"creatorName":"二村, 夏彦"},{"creatorName":"筧, 捷彦"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Oshihiko, Futamura","creatorNameLang":"en"},{"creatorName":"Natuhiko, Futamura","creatorNameLang":"en"},{"creatorName":"Katuhiko, Kakehi","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"実際的に高速な整列法を提案する。まず数列がどの程度非整列であるかを明確にするために数列の攪乱要因dと呼ぶ新しい概念を導入する．それは「両隣の要素よりも大きい要素（攪乱要素）の個数」である。次に0≦d≦（?）/2かつ長さnの全数列についてのdの平均値は（?）/3であることを示し，対称ヒープを利用した新しい整列法（対称ソート）が与えられた数列の長さnのみならずその攪乱要因dにも明白に依存する平均O（*log（））かつ最悪O（*）時間の整列法であることを証明する（ただしd=0およびd=1のときは例外的に最悪O（）時間で整列できる）。最後にQUICKソートおよびリストマージソートとの比較実験および計算量の理論的検討結果を示す。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"A new sorting algorithm called symmetric sort and running fast in practical uses is described. The disordering factor d of a sequence is introduced to evaluate the disorderedness of the sequence. The d is the number of elements which are greater than both their left and right elements. Then, 0≦d≦(n-1) and the fact that the average value of d is (n-2)/3 are shown. It is proved that the symmetric sort runs in O(n*log(d)) average and O(n*d) worst case time on a sequence with length n and disordering factor d>1. For d=o or d=1, the sort runs in O(n) worst case time. Finally, results of theoretical and experimental comparison between the performances of QUICK sort, list-merge sort and symmetric sort are presented.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"67","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"59","bibliographicIssueDates":{"bibliographicIssueDate":"1992-07-17","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"58(1992-AL-028)","bibliographicVolumeNumber":"1992"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":32533,"links":{}}