Suppose we have a file of n records which are partially sorted as x1 <= x2 <= x3 <= … <= xm, and xm+1 <= ….. <= xn, is it possible to sort the entire file in time O(n) using only a small fixed amount of additional storage?
|CodeGuru Home||VC++ / MFC / C++||.NET / C#||Visual Basic||VB Forums||Developer.com|
Results 1 to 10 of 10
Thread: Writing algorithms.
Click Here to Expand Forum to Full Width
This is a CodeGuru survey question.