On Tue, Nov 2, 2010 at 11:23 AM, Terry Reedy <tjreedy at udel.edu> wrote: > What I did say in the post you responded to is "Any programmer who sorts (or > uses functions that depend on proper sorting) should know and respect the > difference between partial orders, such as set inclusion, and total orders, > such as lex order of sequences." FWIW (i.e. not much): before this thread if you'd asked me about partial and total orders I'd have had to run to Wikipedia real quick to figure it out. Hopefully I'm still allowed to use Python. Jacob
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4