What is an efficient algorithm for randomly assigning a pool of objects to a parent using specific rules

I need some expert answers to help me determine the most efficient algorithm in this scenario.

Subset whose sum gets closest to saturating some bound

I have a problem that boils to down having a set of integers and wanting the subset of those integers whose sum is closest to some target without going over. What’s a good algorithm for doing this? Maybe it’s even a well known problem whose name I don’t know?

Shortest Common Superstring: find shortest string that contains all given string fragments

Given some string fragments, I would like to find the shortest possible single string (“output string”) that contains all the fragments. Fragments can overlap each other in the output string.

Designing Algorithm Flowchart Application

I need to develop an GUI application in C# where users can freely add conditional/statement blocks on the algorithm flowchart like the one shown below. By freely, I mean users can add a block on wherever the arrows are.

What is a good algorithm to distribute items with specific requirements?

I have to programmatically distribute a set of items to some entities, but there are rules both on the items and on the entities like so:

Generic Adjacency List Graph implementation

I am trying to come up with a decent Adjacency List graph implementation so I can start tooling around with all kinds of graph problems and algorithms like traveling salesman and other problems… But I can’t seem to come up with a decent implementation. This is probably because I am trying to dust the cobwebs off my data structures class.

How do you write a linearithmic algorithmn?

Write psuedocode to determine the number of pairs of values in an
input file that are equal. If your first try is quadratic, think again
and develop a linearithmic solution.

String patterns that can be used to filter and group files

One of our application filters files in certain directory, extract some data from it and export a document from the extracted data. The algorithm for extracting the data depends on the file, and so far we use regex to select the algorithm to be used, for example .*.txt will be processed by algorithm A, foo[0-5].xml will be processed by algo B, etc.

Developing a search algorithm

I want to create a basic search engine, and I want you to give me some ideas how to filter out the best results for my visitors.

Why the bound of a linear function is same as that of a quadratic equation

I am learning algorithms, and I came across something very interesting.