I need to identify groups of users sharing similar interests including time availability. What’s the best Machine Learning algorithm for this purpose?

How do I solve more problems, or close to 10 problems (sorted according to number of users solved), in SPOJ in a week?

What is the worst case time complexity of finding an element in a sparsely populated hashmap?

What if we used geometric mean instead of arithmetic in binary search algorithm?

How do recursive functions work?

Which feature of an extraction algorithm is suitable for bird sound analysis?

What are the parameters of image segmentation algorithms through which their performance can be measured or they can be compared?

How do I know when to use the tree data structure?

Where can I download materials on hacking for beginners?

What is the interpretation of brute force solution to a problem in terms of Turing Machine?

Why/how are the two recurrence relations of the rod cutting problem equivalent?

How does the Lin-Kernighan heuristic works for TSP?

What is arranging the elements of an array in a specific order called?

Would this Java implementation of summing the leaves of a binary search tree work?

What is the C++ code for the Liang-Barsky Line Clipping algorithm?

How can I solve 671B Robin Hood problem from codeforces using binary search?

What does front=rear=null and front=rear=-1 in queue of data structures in C++ mean?

In how many ways can a number 2744 be written as a product of two different factors?

Is there any other way to write a program to find even/odd without using % operator so that the time complexity reduces and effciency increases?

How can AI algorithms be run on low performance devices (microprocessors, blockchain, …)?