Talk:Order two numerical lists: Difference between revisions
Content added Content deleted
(question about the order) |
m (→Test Cases: tweak description for clarity) |
||
| Line 12: | Line 12: | ||
==Test Cases== |
==Test Cases== |
||
I found the description a bit confusing at first. I used the following test cases where demo_list_llt was a wrapper to support my interpretation. --[[User:Dgamey|Dgamey]] 03:24, 30 November 2011 (UTC) |
I found the description a bit confusing at first. I used the following test cases where demo_list_llt was a wrapper to support my interpretation. This is based on ordering being to choose which of two list scomes first (not sorting). --[[User:Dgamey|Dgamey]] 03:24, 30 November 2011 (UTC) |
||
<pre> write() |
<pre> write() |
||
demo_list_llt([-1],[0]) # << ok |
demo_list_llt([-1],[0]) # << ok |
||
| Line 46: | Line 46: | ||
return s |
return s |
||
end</pre> |
end</pre> |
||
==Stable Sort??== |
==Stable Sort??== |
||
: Where did this requirement come from? There was nothing about sorting only comparison. Neither list is touched. There is no merge or no sort. Did I miss something? --[[User:Dgamey|Dgamey]] 03:24, 30 November 2011 (UTC) |
: Where did this requirement come from? There was nothing about sorting only comparison. Neither list is touched. There is no merge or no sort. Did I miss something? --[[User:Dgamey|Dgamey]] 03:24, 30 November 2011 (UTC) |
||