Right examples have the keyword "hardsort" on the OEBP.

Contrast "hardsort" to @infodense, where examples have a high amount of information, but perhaps after parsing all the information in the examples it is easy to sort them.

BPs labelled "hardsort" are likely to be labelled @hard, but perhaps not--e.g. in BP323 the answer is easy to guess, but laborious to verify.

Right examples have the keyword "hardsort" on the OEBP.

Contrast "hardsort" Problems to "infodense" (left-BP978) Problems, in which examples have a high amount of information, but perhaps after parsing all the information in the examples it is easy to sort them.

BPs labelled "hardsort" are likely to be labelled "hard" (right-BP501), but perhaps not--e.g. in BP323 the answer is easy to guess, but laborious to verify.

Right examples have the keyword "hardsort" on the OEBP.

Contrast "hardsort" Problems to "infodense" (left-BP978) Problems, in which examples have a high amount of information, but perhaps after parsing all the information in the examples it is easy to sort them.

BPs labelled "hardsort" are likely to be labelled "hard" (right-BP501), but perhaps not--e.g. in

BP323 the big-picture answer is easy to guess, but laborious to verify.

Right examples have the keyword "hardsort" on the OEBP.

Contrast "hardsort" Problems to "infodense" (left-BP978) Problems, in which examples have a high amount of information, but perhaps after parsing all the information in the examples it is easy to sort them.

BPs labelled "hardsort" are likely to be labelled "hard" (right-BP501), but perhaps not--e.g. in

BP323 the big-picture answer is easy to guess, but difficult to verify.

Right examples have the keyword "hardsort" on the OEBP.

Contrast "hardsort" Problems to "infodense" (left-BP978) Problems, in which examples have a high amount of information, but perhaps after parsing all the information in the examples it is easy to sort them.

See "easy vs. hard" BP501.

Right examples have the keyword "hardsort" on the OEBP.

As in the "easy vs. hard" keyword Problem BP501, "hard" means hard for humans.

Contrast "hardsort" Problems to "infodense" (left-BP978) Problems, in which examples have a high amount of information, but perhaps after parsing all the information in the examples it is easy to sort them.

Right examples have the keyword "hardsort" on the OEBP.

As in the "easy vs. hard" keyword Problem BP501, "hard" means hard for humans.

Contrast "hardsort" Problems to "dense" (left-BP978) Problems, in which examples have a high amount of information, but perhaps after parsing all the information in the examples it is easy to sort them.

Right examples have the keyword "hardsort" on the OEBP.

As in the "easy vs. hard" keyword Problem BP501, "hard" means hard for humans.

Contrast "hardsort" Problems to "dense" (right-BP978) Problems, in which examples have a high amount of information, but perhaps after parsing all the information in the examples it is easy to sort them.