Big O ignores constants, but you should not. An O(n) algorithm with 1000n operations loses to an O(n log n) algorithm with 2n log n operations for small n.
Benchmark your code. Theory predicts scaling, but real performance depends on cache, memory access patterns, and compiler optimizations.
Use Big O to rule out bad algorithms. Use profiling to choose between good ones.