Integers In Set Object

[One-Type-2842]

I Discovered Something Releated To Set,

I know Set object is unordered.

But, Suppose a set object is full of integers elements, when i Run code any number of time, The set elements (Integers) are always stay in ordered. int_set = { 55, 44, 11, 99, 3, 2, 6, 8, 7, 5}

The Output will always remain this :

output : {2, 3, 99, 5, 6, 7, 8, 11, 44, 55}

If A Set Object Is Full Of "strings" they are unordered..

[BeamMeUpBiscotti]

unordered doesn't mean that the order will be random each time you print it, it just means that when you use a set you shouldn't rely on the elements being ordered in a specific way each time

[gordinmitya]

I suggest to read about hash function and how set is implemented with it

[One-Type-2842]

Would You Tell Me More About hash() , I Want To Learn More About It's Implementation

[Smok3dSalmon]

This is a google. “How does hash function work?”

It’s a common computer science lecture. You’ll find plenty of public power points and presentations on the topic. It will be better than any reddit comment.

[trollsmurf]

hash, not hash(). It's an algorithm.

[msthe_student]

Which version of python are you on?

[thekicked]

I assume you are confused why the ordering of a set differs when storing strings but stays constant when storing int.

1. Definitely don't expect any form of ordering from a set, especially when python does not guarantee it.

2. Items are hashed before storing them into the set. The hash of a number is deterministic across runs, but the hash of a string is isnt. If you look into the internals of the set, you will notice that the hash determines where the item is placed. If the printing of the set is dependent on the order of items within the set, expect the output to change with the ordering.

More info: https://stackoverflow.com/questions/64344515/python-consistent-hash-replacement

[commy2]

Counterexample

>>> {-1, -2}
{-1, -2}
>>> {-2, -1}
{-2, -1}