| Presentation | 1998/12/4 Mergesort with Small Working Area Yoichi Hagiwara, Satoshi Ikeda, Mario Nakamori, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Mergesort is one of the fastest sorting algorithm, since it requires only 0(n log n) of computing time. Mergesort, however, requires an array of size n as working area, when executed as an internal sort. In the present paper, we propose an algorithm which is a modified version of mergesort. The space complexity of the proposed alogorithm is only 0(1). The time complexity is 0(n log^2 n), which is worse than the existing merge sort and is the result of the tradeoffs between time and space complexities. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | sort / mergesort |
| Paper # | COMP98-70 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 1998/12/4(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Mergesort with Small Working Area |
| Sub Title (in English) | |
| Keyword(1) | sort |
| Keyword(2) | mergesort |
| 1st Author's Name | Yoichi Hagiwara |
| 1st Author's Affiliation | Computer Center, Tokyo University of Agriculture and Technology() |
| 2nd Author's Name | Satoshi Ikeda |
| 2nd Author's Affiliation | Department of Computer Science Tokyo University of Agriculture and Technology |
| 3rd Author's Name | Mario Nakamori |
| 3rd Author's Affiliation | Department of Computer Science Tokyo University of Agriculture and Technology |
| Date | 1998/12/4 |
| Paper # | COMP98-70 |
| Volume (vol) | vol.98 |
| Number (no) | 442 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |