It's possible to have more than one worst. In a totally-ordered collection this happens if you have two or more equal elements, which happen to be worse or equal to any other element. In a partially-ordered collection, there could be groups of elements that are not comparable between each other, and so you will potentially have multiple distinct worst elements.
Trivially, in a collection that has no "worse than" relation you can define one that doesn't compare them at all, and declares them all "incomparable" -- which, again, would make them all worst.
Bonus question: can you imagine a collection where there is no worst element?
> How do you rank C, Perl, JavaScript, PHP
Well, none of these languages have their own parallelism / concurrency aspect. (Except Perl 5 maybe? I'm not really familiar with the language). They all rely on the system running them to do the parallelism.
So... all of these will go roughly into the same bin as Python?
Some languages have libraries that would allow them to do better (eg. you have PThreads in C), but that's not the function of the language.
Trivially, in a collection that has no "worse than" relation you can define one that doesn't compare them at all, and declares them all "incomparable" -- which, again, would make them all worst.
Bonus question: can you imagine a collection where there is no worst element?
> How do you rank C, Perl, JavaScript, PHP
Well, none of these languages have their own parallelism / concurrency aspect. (Except Perl 5 maybe? I'm not really familiar with the language). They all rely on the system running them to do the parallelism.
So... all of these will go roughly into the same bin as Python?
Some languages have libraries that would allow them to do better (eg. you have PThreads in C), but that's not the function of the language.