One way to phrase it intuitively is "the probability of any particular output from two databases that differ by one element is almost the same". The bound on "almost" is captured by the privacy parameter ε.
One of the smoking guns that this algorithm is not differentially private is that the code doesn't import `random` anywhere! A differentially private algorithm is always going to be stochastic.
differential privacy is any search that protects individual inputs from disclosure