Back to Results
First PageMeta Content
Theoretical computer science / Insertion sort / Priority queue / Time complexity / Library sort / Chernoff bound / Permutation / Sequence container / Scapegoat tree / Mathematics / Order theory / Sorting algorithms


I NSERTION S ORT is O(n log n) ∗ Michael A. Bender†
Add to Reading List

Document Date: 2007-02-06 19:39:51

Open Document

File Size: 59,47 KB

Share Result on Facebook

City

Piscataway / Melville / Konheim / /

Company

Sandia National Laboratories / Google / /

Country

United States / /

/

Facility

Rutgers University / Library Sort / /

IndustryTerm

high-tech / search trees / binary search / mailbox protocol / technology / search cost / final search / cache-oblivious algorithms / in-place sorting algorithm / mailbox technology / /

Organization

National Science Foundation / Department of Computer Science / Rutgers University / SUNY / /

Person

Miguel Mosteiro / Ian Munro / Michael A. Bender† Mart / Erik Demaine / /

Position

librarian / /

ProvinceOrState

New Jersey / New York / /

Technology

mailbox protocol / in-place sorting algorithm / cache-oblivious algorithms / mailbox technology / /

SocialTag