{"created":"2023-07-25T08:14:35.247653+00:00","id":15662,"links":{},"metadata":{"_buckets":{"deposit":"e0499de4-b1f4-4852-a8ab-ece59cc18be8"},"_deposit":{"created_by":18,"id":"15662","owners":[18],"pid":{"revision_id":0,"type":"depid","value":"15662"},"status":"published"},"_oai":{"id":"oai:ir.kagoshima-u.ac.jp:00015662","sets":["228:229:5997","37:53"]},"author_link":[],"item_7_biblio_info_5":{"attribute_name":"収録雑誌名","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2020-12-31","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"15","bibliographicPageStart":"1","bibliographicVolumeNumber":"53","bibliographic_titles":[{"bibliographic_title":"鹿児島大学理学部紀要","bibliographic_titleLang":"ja"},{"bibliographic_title":"Reports of the Faculty of Science, Kagoshima University","bibliographic_titleLang":"en"}]}]},"item_7_date_6":{"attribute_name":"作成日","attribute_value_mlt":[{"subitem_date_issued_datetime":"2020-12-31","subitem_date_issued_type":"Issued"}]},"item_7_description_4":{"attribute_name":"要約(Abstract)","attribute_value_mlt":[{"subitem_description":"We studied on typical sorting algorithms, compared their efficiencies, and proposed and evaluated a new sorting algorithms. In this paper, for some typical sorting algorithms, the principle and properties of each algorithm are described, and a function-type program in C language is given. Numerical experiments were used to compare and evaluate the execution times of the three O(n2) sorting algorithms (i.e., Bubble sort, Insertion sort and Selection sort) and the three O(nlogn) sorting algorithms ( i.e., Quicksort, Heaposrt and Mergesort). Furthermore, we proposed a new algorithm called Binary search insertion sort, compared it with the conventional Insertion sort, and confirmed that it can sort at a high speed of about 68%.","subitem_description_language":"en","subitem_description_type":"Other"}]},"item_7_publisher_23":{"attribute_name":"公開者・出版者","attribute_value_mlt":[{"subitem_publisher":"鹿児島大学","subitem_publisher_language":"ja"},{"subitem_publisher":"Kagoshima University","subitem_publisher_language":"en"}]},"item_7_source_id_7":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"13456938","subitem_source_identifier_type":"PISSN"}]},"item_7_source_id_9":{"attribute_name":"NII書誌ID","attribute_value_mlt":[{"subitem_source_identifier":"AA11246904","subitem_source_identifier_type":"NCID"}]},"item_7_subject_15":{"attribute_name":"NDC","attribute_value_mlt":[{"subitem_subject":"007","subitem_subject_scheme":"NDC"}]},"item_7_version_type_14":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"新森, 修一","creatorNameLang":"ja"},{"creatorName":"SHINMORI, Shuichi","creatorNameLang":"en"}]},{"creatorNames":[{"creatorName":"荒谷, 遙香","creatorNameLang":"ja"},{"creatorName":"ARATANI, Haruka","creatorNameLang":"en"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2021-01-26"}],"displaytype":"detail","filename":"AA11246904_v53_p1-15.pdf","filesize":[{"value":"1.4 MB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"AA11246904_v53_p1-15","objectType":"fulltext","url":"https://ir.kagoshima-u.ac.jp/record/15662/files/AA11246904_v53_p1-15.pdf"},"version_id":"0f14430b-407a-48af-845a-175f4d0a3da7"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"Sorting algorithm","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Insertion sort","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Quicksort","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Data structure","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Numerical experiments","subitem_subject_language":"en","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"整列アルゴリズムの比較評価と二分探索挿入ソートの提案","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"整列アルゴリズムの比較評価と二分探索挿入ソートの提案","subitem_title_language":"ja"},{"subitem_title":"Comparative Evaluation of Some Sorting Algorithms and Proposal of Binary Search Insertion Sort","subitem_title_language":"en"}]},"item_type_id":"7","owner":"18","path":["53","5997"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2021-01-26"},"publish_date":"2021-01-26","publish_status":"0","recid":"15662","relation_version_is_last":true,"title":["整列アルゴリズムの比較評価と二分探索挿入ソートの提案"],"weko_creator_id":"18","weko_shared_id":-1},"updated":"2024-02-08T04:49:20.748231+00:00"}