All Questions
9
questions
1
vote
0
answers
41
views
Algorithm for sorting by equivalence relation
I hope the thread title isn't too strange, but I don't know better.
My question seems a quite simple one.
Having a set of objects I'm interested in the subsets that are pairwise equal.
Example:
A set ...
- 21
2
votes
2
answers
1k
views
Sorting numbers with a special set of permutations
I'm wondering if there are well known sorting techniques for the following problem.
Problem:
Suppose you would like to sort a list of integer numbers $0, 1, 2, \ldots, d$.
If one is only allowed to ...
- 1,284
0
votes
2
answers
60
views
What is the name of shorting algorithm used? [closed]
For example,
Set X = { Apple = 1, Banana = 2, Cucumber = 3 }
Set Y = { CFO = 1, CFO = 2, CSO = 3 }
Combinations are in some order
[X, Y] = K
[1, 1] = 1
[1, 2] = 2
[2, 1] = 3
[1, 3] = 4
[2, 2] = 5
[3,...
- 3
0
votes
0
answers
56
views
Inversions of a Deck of Cards
Suppose I have a deck of cards in some ordering. Consider all of the other possible orderings of this same deck relative to the first one. Is there a bound we can put on the maximum number of ...
- 652
0
votes
0
answers
52
views
Sort numbers with minimum comparison
We have 6 balls of 1,2,3,4,5 and 6 grams. How to find each one's weight using a 2 sides balance (a side can take many balls).
- 1
1
vote
1
answer
51
views
Number of comparisons of putting a sorted array of size $n$ into $k$ boxes
Suppose I have an array of numbers with size $n$, denoted as $A$ and the numbers inside have already been sorted from smallest to largest. I have $k$ boxes, and $k<n$. For each box, there is a ...
- 69
1
vote
1
answer
324
views
Formulating an equation for a group sorting program.
I'm trying to formulate an equation/algorithm to solve this problem (for a program I'm writing):
Rules:
A person, p, that is to be sorted can exclude n amount of people from the list. The excluded ...
- 11
5
votes
0
answers
131
views
Analysis of sorting Algorithm with probably wrong comparator?
It is an interesting question from an Interview, I failed it.
An array has $n$ different elements $[A_1 , A_2, ..., A_n]$ （random order）.
We have a comparator $C$, but it has a probability $p$ to ...
- 61
1
vote
1
answer
772
views
An efficient algorithm to pair chess players in a team tournament
I found this question on a website.
Your team is playing a chess tournament against a visiting team. Your opponents have arrived with a team of $M$ players, numbered $1,2,\dots,M$. You have $N$ ...
- 11