Click here to Skip to main content
15,895,283 members
Home / Discussions / Algorithms
   

Algorithms

 
GeneralSolutions distribution of the N-Queens problem Pin
zubetto12-Oct-17 10:53
zubetto12-Oct-17 10:53 
GeneralRe: Solutions distribution of the N-Queens problem Pin
Richard MacCutchan12-Oct-17 11:17
mveRichard MacCutchan12-Oct-17 11:17 
GeneralRe: Solutions distribution of the N-Queens problem Pin
zubetto12-Oct-17 11:34
zubetto12-Oct-17 11:34 
GeneralRe: Solutions distribution of the N-Queens problem Pin
Richard MacCutchan12-Oct-17 22:05
mveRichard MacCutchan12-Oct-17 22:05 
QuestionNeed to display dialog until all questions answered Pin
Christopher Cote11-Oct-17 3:24
Christopher Cote11-Oct-17 3:24 
AnswerRe: Need to display dialog until all questions answered Pin
Sascha Lefèvre11-Oct-17 4:01
professionalSascha Lefèvre11-Oct-17 4:01 
AnswerRe: Need to display dialog until all questions answered Pin
Jochen Arndt11-Oct-17 4:07
professionalJochen Arndt11-Oct-17 4:07 
QuestionSorting Algorithm to maximize 'availability' (help please) Pin
Member 134476015-Oct-17 3:30
Member 134476015-Oct-17 3:30 
Could someone point me to an algorithm or something that might help me solve this problem:

I have 3 tours going to Disneyland, each of these tours need tickets for the passengers to get into Disneyland. In total I have 60 tickets and they can be distributed in this way: I have 20 tickets to share between Tour1 and Tour2. I have another 20 tickets to share between Tour2 and Tour3. I have another 20 tickets for just Tour3.
Image of ticket allocation to tours[^]

For each person that books a tour, the ticket number is reduced by 1.

I want to maximize the availability that is shown to the user when they are attempting to book any of the 3 tours

With no bookings, the Availability for each tour is:
Tour1: 20
Tour2: 40
Tour3: 40

If we now add bookings for each tour:
Tour1 Bookings: 12
Tour2 Bookings: 10
Tour3 Bookings: 10

The availability when looking at each tour INDIVIDUALLY (aka how many tickets can I book), it should return:
Tour1: 8
Tour2: 18
Tour3: 28

Image[^]

As we increase bookings, availability will be adjusted accordingly. Notice in the next example, when there are an additional 10 bookings for Tour1, Availability for all 3 tours change:
Tour1 Bookings: 18
Tour2 Bookings: 10
Tour3 Bookings: 10

The availability when looking at each tour INDIVIDUALLY (aka how many tickets can I book), it should return:
Tour1: 2
Tour2: 12
Tour3: 22

Image[^]

I'm sure someone has already come up with an algorithm for this... could someone point me in the right direction? Please?

modified 5-Oct-17 10:01am.

AnswerRe: Sorting Algorithm to maximize 'availability' (help please) Pin
Ralf Meier6-Oct-17 0:35
mveRalf Meier6-Oct-17 0:35 
AnswerRe: Sorting Algorithm to maximize 'availability' (help please) Pin
Gerry Schmitz7-Oct-17 6:41
mveGerry Schmitz7-Oct-17 6:41 
QuestionEfficiently comparing results from an XPath query to a resultset returned from a database table Pin
terrybogard44-Oct-17 14:49
terrybogard44-Oct-17 14:49 
AnswerRe: Efficiently comparing results from an XPath query to a resultset returned from a database table Pin
Gerry Schmitz7-Oct-17 6:57
mveGerry Schmitz7-Oct-17 6:57 
QuestionConditional assembly Pin
A Jordison27-Sep-17 23:53
A Jordison27-Sep-17 23:53 
AnswerRe: Conditional assembly Pin
Jochen Arndt28-Sep-17 0:09
professionalJochen Arndt28-Sep-17 0:09 
GeneralRe: Conditional assembly Pin
A Jordison28-Sep-17 0:13
A Jordison28-Sep-17 0:13 
GeneralRe: Conditional assembly Pin
Jochen Arndt28-Sep-17 0:20
professionalJochen Arndt28-Sep-17 0:20 
AnswerRe: Conditional assembly Pin
Gerry Schmitz28-Sep-17 10:33
mveGerry Schmitz28-Sep-17 10:33 
QuestionCompare similarity of values that can have different lenght, number of words between 2 or more documents. Pin
Member 1342117220-Sep-17 21:46
Member 1342117220-Sep-17 21:46 
AnswerRe: Compare similarity of values that can have different lenght, number of words between 2 or more documents. Pin
Gerry Schmitz21-Sep-17 12:49
mveGerry Schmitz21-Sep-17 12:49 
QuestionEfficiently sort the following? Pin
arnold_w24-Aug-17 10:18
arnold_w24-Aug-17 10:18 
GeneralRe: Efficiently sort the following? Pin
harold aptroot24-Aug-17 10:28
harold aptroot24-Aug-17 10:28 
GeneralRe: Efficiently sort the following? Pin
arnold_w24-Aug-17 10:48
arnold_w24-Aug-17 10:48 
AnswerRe: Efficiently sort the following? Pin
Richard MacCutchan24-Aug-17 21:05
mveRichard MacCutchan24-Aug-17 21:05 
AnswerRe: Efficiently sort the following? Pin
Richard Deeming25-Aug-17 1:47
mveRichard Deeming25-Aug-17 1:47 
GeneralRe: Efficiently sort the following? Pin
arnold_w28-Aug-17 0:40
arnold_w28-Aug-17 0:40 

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.