Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with algorithms
Search options not deleted
user 45918
An algorithm is a sequence of well-defined steps that defines an abstract solution to a problem. Use this tag when your issue is related to design and analysis of algorithms.
0
votes
Seating arrangement problem
If the table is round, then this problem is a variant of the famous Travelling Salesman Problem and any of the many solutions in published literature can be consulted for solving it.
- 209
2
votes
3
answers
9k
views
Seating arrangement problem
$n$ professors go to a conference and have to sit together at a table. See illustration below for $n=8$
Each professor has people they like to sit next to and people they do not want to sit next …
- 209