A model for a privacy oriented ad network that profiles content, not users

A few days ago I came across a talk by Maciej Ceglowski titled Notes from an Emergency. If you have not watched the talk, stop reading this and go watch it. In the talk, he makes a suggestion that the Government should regulate ads to target content, not users. There was a discussion about the talk on Hacker News where Maciej, in response to a comment that implied ads that target content will be worse than ads that target users, said that’s why he feels it’s a regulatory argument and not a business argument. [Read More]

Merge sort

Merge sort is a divide and conquer algorithm. It is a fast, general purpose sorting algorithm.

Time complexity:

Average case : O(n log n)

Best case : O(n log n)

Worst case : O(n log n)

Worst case space complexity : O(n)

[Read More]

Insertion sort

Insertion sort is an in-place sorting algorithm which builds the sorted list one item at a time.

Time complexity :

Average case : O(n2)

Best case : O(n)

Worst case : O(n2)

Worst case space complexity : O(n)

[Read More]

Selection sort

Selection sort is an in-place sorting algorithm.

Time complexity :

Average case : O(n2)

Best case : O(n2)

Worst case : O(n2)

Worst case space complexity : O(n)

[Read More]

Quicksort

Quicksort is a divide and conquer algorithm. Quicksort first divides a large array into two smaller sub-arrays: the low elements and the high elements can then recursively sorts the sub-arrays.

Quicksort is considered to one of the fastest general purpose sorting algorithms even today.

Time complexity:

Average case : n log n

Best case : n log n with simple partition

Worst case : n2

[Read More]