MrComputerScience.com
Blog For Marketing And Tech Nerds
False sharing happens when two CPU cores modify different variables that happen to live on the same cache line. The hardware treats the entire line as contested and forces expensive synchronization on …
Continue Reading about What Is False Sharing and Why It Kills Parallel Performance →
Calling free() does not return memory to the operating system. It returns memory to your allocator's internal free list, where it sits available for future malloc() calls within the same process. The …
Continue Reading about What Actually Happens When You Call free() in C? →
Cache-oblivious algorithms outperform cache-aware ones because they optimize for every level of the memory hierarchy simultaneously without being tuned for any specific one. Cache-aware algorithms are …
Continue Reading about How Cache-Oblivious Algorithms Beat Cache-Aware Design →
Integer factorization is believed to be hard, but it has never been proven NP-complete. If it were NP-complete, RSA encryption would collapse the moment P=NP was proven. The fact that factorization …
Continue Reading about Why Isn’t Integer Factorization Proven NP-Complete? →
They sound interchangeable but measure completely different things. Average-case complexity describes expected performance across random inputs. Amortized complexity describes guaranteed performance …
Continue Reading about Amortized vs Average-Case Time Complexity Explained →
Both quicksort and mergesort are O(n log n), but quicksort wins in practice because it works in-place and plays well with CPU caches. Mergesort requires O(n) extra memory and scatters data across …
Continue Reading about Why Quicksort Beats Mergesort in Practice →
