Improve clarity in Bisect.rst about prequisites

[manoj-km24]

Documentation

In Doc/library/bisect.rst , The documentation never tells the reader that the list has to be sorted in ascending order for the functions to work correctly in the beginning.

This module provides support for maintaining a list in sorted order without 
having to sort the list after each insertion.

I can open a PR that modifies this to:

This module provides support for maintaining a list, sorted in ascending order without
having to sort the list after each insertion.

or something else ,if required.

[picnixz]

This is not true. It can be sorted in descending order or with respect to anything else (a key)

[picnixz]

Edit: sorry for the reverse order it is only heapq that exposes it. But the ordering is according to the key so I would not say ascending order as it meany that we are sorting the values directly.

[picnixz]

Ok let me take a step back. I agree that it could be slightly confusing but I do not like the fact that ascending order does not mention the possibility that it is a keyed ordering (i.e. working on something else). The functions do not mention either this but they explicitly say what the resulting index does. So I guess we could add that adjective. But OTOH, this would likely require to update docstrings and C extensions.

I think when we use "sorted", it is implicitly "ascending".

@rhettinger What do you prefer? explicitly mentioning ascending or leave it as is to not expand a text that is already long?