How do I solve T(n) = 4T(n/2) + nlogn, if n is a power of 2 and T(n) = 1 if n = 1?

Where can I find a list of all the clustering algorithms?

Is there a formula for the number of permutations of [n] with k peaks with DP with matrix multiplication?

What’s the best sorting algorithm that doesn’t need to store more information than the list itself?

How can I cluster trees by their distance?

Is 1SAT NP-complete?

Which one should be learned first, data structures or algorithms?

What are the best books to learn data structures in C?

Are we just an algorithm?

Is it possible to predict the verification codes for sites like Facebook and Gmail using Machine Learning?

How can we determine the number of comparisons in a “linear search”?

What is the difference between static recursive functions and non-static recursive functions C/C++?

Given a complete graph KN, what is the number of distinct spanning trees possible from a depth-first search?

How would you swap nodes in a binary tree?

What algorithm questions were you asked at an Amazon/Microsoft/Google interview?

How do you draw a flowchart for finding the sum of first N multiples of an integer of K?

Is a string a palindrome?

What is a fun, interesting book to learn algorithms?

What are some of the best algorithms in neuroinformatics?

How can we formally (mathematically) define a function that produces the k-th (say lexographically ordered) permutation from a given permutation?