Click here to Skip to main content
15,946,988 members
Home / Discussions / Algorithms
   

Algorithms

 
GeneralRe: [edited]Re: Base building in a RTS based on a queue of orders Pin
Gerry Schmitz29-Apr-23 3:48
mveGerry Schmitz29-Apr-23 3:48 
General[edit][edit]Re: Base building in a RTS based on a queue of orders Pin
Calin Negru30-Apr-23 5:23
Calin Negru30-Apr-23 5:23 
GeneralRe: [edit][edit]Re: Base building in a RTS based on a queue of orders Pin
Gerry Schmitz30-Apr-23 6:14
mveGerry Schmitz30-Apr-23 6:14 
GeneralRe: [edit][edit]Re: Base building in a RTS based on a queue of orders Pin
Calin Negru30-Apr-23 22:12
Calin Negru30-Apr-23 22:12 
GeneralRe: [edit][edit]Re: Base building in a RTS based on a queue of orders Pin
Gerry Schmitz1-May-23 0:08
mveGerry Schmitz1-May-23 0:08 
GeneralRe: [edited]Re: Base building in a RTS based on a queue of orders Pin
Calin Negru30-Apr-23 5:10
Calin Negru30-Apr-23 5:10 
GeneralRe: [edited]Re: Base building in a RTS based on a queue of orders Pin
Gerry Schmitz30-Apr-23 6:29
mveGerry Schmitz30-Apr-23 6:29 
QuestionEfficiently finding position in sorted list Pin
Robert Ellis26-Mar-23 13:52
Robert Ellis26-Mar-23 13:52 
Say we have a set of positive integer numbers and the size of the set is always Q

For each position in the set we can define a minimum value and maximum value, both inclusive, for the value that could appear at that position in the set.

We can then deterministically sort a list of all of the distinct permutations of Q. To do so, We will sort first by the position 1 value, then (where the position 1 value is the same across multiple permutations) by the position 2 value and so on and so forth through to position Q being the least significant for the sort.

Given a single valid permutation of this type, is there a mathematically efficient way of determining its position in the sorted list, that is, without ever creating or iterating the list?
Conceptually reversing the above, given a position in the sorted list, is there a mathematically efficient way of determining the corresponding permutation, without ever creating or iterating the list?
AnswerRe: Efficiently finding position in sorted list Pin
Mircea Neacsu26-Mar-23 14:42
Mircea Neacsu26-Mar-23 14:42 
QuestionDijkstra Pin
Calin Negru13-Dec-22 7:46
Calin Negru13-Dec-22 7:46 
AnswerRe: Dijkstra Pin
jschell13-Dec-22 10:39
jschell13-Dec-22 10:39 
GeneralRe: Dijkstra Pin
Calin Negru13-Dec-22 22:34
Calin Negru13-Dec-22 22:34 
GeneralRe: Dijkstra Pin
jschell20-Dec-22 13:21
jschell20-Dec-22 13:21 
GeneralRe: Dijkstra Pin
Calin Negru26-Dec-22 9:26
Calin Negru26-Dec-22 9:26 
GeneralRe: Dijkstra Pin
jschell29-Dec-22 11:20
jschell29-Dec-22 11:20 
GeneralRe: Dijkstra Pin
Calin Negru30-Dec-22 8:56
Calin Negru30-Dec-22 8:56 
GeneralRe: Dijkstra Pin
harold aptroot2-Jan-23 6:45
harold aptroot2-Jan-23 6:45 
AnswerRe: Dijkstra Pin
Eddy Vluggen2-Jan-23 10:48
professionalEddy Vluggen2-Jan-23 10:48 
GeneralRe: Dijkstra Pin
Graeme_Grant2-Jan-23 11:41
mvaGraeme_Grant2-Jan-23 11:41 
QuestionRe: Dijkstra Pin
Eddy Vluggen2-Jan-23 11:59
professionalEddy Vluggen2-Jan-23 11:59 
AnswerRe: Dijkstra Pin
Graeme_Grant2-Jan-23 12:16
mvaGraeme_Grant2-Jan-23 12:16 
NewsRe: Dijkstra Pin
Eddy Vluggen2-Jan-23 12:27
professionalEddy Vluggen2-Jan-23 12:27 
GeneralRe: Dijkstra Pin
Calin Negru3-Jan-23 0:19
Calin Negru3-Jan-23 0:19 
GeneralRe: Dijkstra Pin
Eddy Vluggen3-Jan-23 0:25
professionalEddy Vluggen3-Jan-23 0:25 
GeneralRe: Dijkstra Pin
Calin Negru3-Jan-23 3:37
Calin Negru3-Jan-23 3:37 

General General    News News    Suggestion Suggestion    Question Question    Bug Bug    Answer Answer    Joke Joke    Praise Praise    Rant Rant    Admin Admin   

Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.