A simple sorting algorithm that works by repeatedly stepping through the list to be sorted, comparing each pair of adjacent items and swapping them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted.
I was looking for a specific theorem called CAP theorem, but came across these interesting, sort of funny but somewhat true, software laws.
I think these laws are useful to get better understanding of philosophy behind a software or computer science in general.
- Atwood’s Law
- Brooks’s Law
Adding manpower to a late software project makes it later.
- Conway’s law
Any piece of software reflects the organizational structure that produced it.
- Miller’s law
To understand what another person is saying, you must assume that it is true and try to imagine what it could be true of.
- Wirth’s law
Software gets slower faster than hardware gets faster.