What is an unbiased Shuffle algorithm? Consider an array with distinct elements A[1 … n] A perfectly unbiased shuffle algorithm would randomly shuffle all elements in the array such that after shuffling: 1.The probability that the shuffling operation would produce any particular permutation of the original array is the same for all permutations (i.e.) since…
Read more
What is an inversion? Let A be an array of n distinct numbers. If i < j and A[i] > A[j], then the pair (i, j) is called an inversion of A. For example, the array {2,3,8,6,1} has 5 inversions: (2,1) (3,1) (8,6) (8,1) and (6,1) Trivial Solution to count the number of inversions in…
Read more
1.DON’T LIE Never lie on your resume. If you are selected for an interview, a seasoned interviewer will be able to sniff out any lie very easily. 2.DON’T PAD YOUR RESUME Don’t add any irrelevant points and formatting. For example, don’t talk about your parents and their professions. Avoid using large fonts with extra spacing…
Read more
