How could I build my own ML library?

In implementing Kruskal’s algorithm, if two edges have the same value which one should one choose?

How can I implement map using binary search tree in Java?

Are ordinary bits, not qubits, inputs to quantum computers/algoritms? What about outputs?

10, log2(n) are two functions from positive integers to real numbers. Why is the asymptotic complexity of 10 less than that of log2(n)?

Why not use Dijkstra or Bellman-Ford for finding the shortest path between two persons in Facebook and why not use bidirectional BFS in DVR or LSR?

Are there any rating systems (similar to Elo) commonly used in single player games?

What hashing algorithm does BIP38 use?

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

What are some cool things created with generative/genetic algorithms?

What is the number of possible quadrilaterals that can be made using the elements of an array?

Suggest some computer science algorithms for mini presentation (10-15min) for masters “Technical Communication and Research methodology” subject?

Is the concept of Distance 2 edge coloring equivalent to (or same as) Strong edge coloring of Graphs?

Given a min-heap of n nodes, how can you determine if there are k nodes less than a node x in O(k)?

Where can I learn how to solve recurrences via summation factor method?

Can a neural network model be easily ported from a PC platform to an embedded system given that neural networks are black boxes algorithms?

What is Dijkstra’s algorithm?

Which machine learning algorithm(s) is best for nonlinear regression with a limited number of data?

What is compressed adjacency list representation in terms of data structures?

How is the problem NOVICE43(Link : NOVICE43)on SPOJ related to Bell Numbers?