Understanding complexity and simple sorting operation

Choose Sort and bubble sort
Choose sorting and put the smallest one first every time
Fake sort , Put the big one back every time , Always sort
The time complexity is o(n^2)
————————————————————————
XOR operation can be recognized as addition without carry
1）0^N=N
2)N^N=0

Satisfying the commutative law , Associative law

XOR has nothing to do with order

a,b It points to a piece of memory
Insertion sort

---

Need to understand stability

---