15,794,629 members
Home / Discussions / Algorithms

# Algorithms

 Re: Creating paths in a 2D array `Randor` 26-Apr-22 18:48 `Randor` 26-Apr-22 18:48
 Re: Creating paths in a 2D array Syed Mubashshir Hasan5-Oct-22 23:50 Syed Mubashshir Hasan 5-Oct-22 23:50
 Virtual sports algorithms. How it works? Cryptocurrency3-Apr-22 20:45 Cryptocurrency 3-Apr-22 20:45
 Re: Virtual sports algorithms. How it works? Gerry Schmitz26-Apr-22 7:00 Gerry Schmitz 26-Apr-22 7:00
 Methods for Solving different forms of Recurrence Relations Dawood Ahmad 20213-Apr-22 11:46 Dawood Ahmad 2021 3-Apr-22 11:46
 Re: Methods for Solving different forms of Recurrence Relations `Randor` 26-Apr-22 19:06 `Randor` 26-Apr-22 19:06
 Help with allocation algorithm Cynthia Moore31-Mar-22 0:53 Cynthia Moore 31-Mar-22 0:53
 Re: Help with allocation algorithm Member 146609423-May-22 5:01 Member 14660942 3-May-22 5:01
 1 - I would make people prioritize the records they want - only 1 number, let's say, from 1 to 100. 2 - They would then choose the records they want, in the rank they want. Not allowed to repeat numbers. With that information, I would assign a priority value for each ranking, the higher the priority (1 is highest), the higher this number is. The balancing of these values is going to be a big part on your "justice". I would do a cumulative priority number, and upon collision, the person that asked first for the record would get it. Let's review this, in a slower way: Let's say you use 1 => 400, 2 => 200, 3 => 100, 4 => 80, 5 => 70, 6 => 60 Now we have the first choice round. Everyone gets 400 priority points. Let's say 5 people. But there is a collision. 2 people chose MC Hammer record. The one that asked for it before is going to get it. The other one... well, tough luck. Now, we have the second choice round. Everyone gets 200 priority points. But, the "un-hamnmered" guy now has 600 priority points. Whatever he chose for choice 2, if available, is going to get picked. After that, everyone else can get their choice of number 2, if available. Just repeat until no more records. This should be a fairly fair system - everyone is probably going to be equally pissed... lol... You are seriously underestimating human beings' capacity for being petty - I hope all goes well, but I really think you're going to have some headache.
 Re: Help with allocation algorithm englebart12-Oct-22 17:01 englebart 12-Oct-22 17:01
 Very smart pointers Andy Oct202121-Mar-22 10:24 Andy Oct2021 21-Mar-22 10:24
 Re: Very smart pointers Greg Utas26-Mar-22 11:14 Greg Utas 26-Mar-22 11:14
 Re: Very smart pointers Member 146609423-May-22 5:13 Member 14660942 3-May-22 5:13
 Re: Very smart pointers Andy Oct20213-May-22 23:21 Andy Oct2021 3-May-22 23:21
 Maximum Sum of Value of Positions Along a Path Jj2093884218-Mar-22 14:30 Jj20938842 18-Mar-22 14:30
 Re: Maximum Sum of Value of Positions Along a Path Richard Andrew x6418-Mar-22 15:11 Richard Andrew x64 18-Mar-22 15:11
 Re: Maximum Sum of Value of Positions Along a Path Jj2093884218-Mar-22 15:21 Jj20938842 18-Mar-22 15:21
 Re: Maximum Sum of Value of Positions Along a Path Richard Andrew x6418-Mar-22 15:25 Richard Andrew x64 18-Mar-22 15:25
 Re: Maximum Sum of Value of Positions Along a Path Jj2093884218-Mar-22 19:40 Jj20938842 18-Mar-22 19:40
 Re: Maximum Sum of Value of Positions Along a Path Gerry Schmitz19-Mar-22 6:33 Gerry Schmitz 19-Mar-22 6:33
 Re: Maximum Sum of Value of Positions Along a Path Jj2093884219-Mar-22 6:49 Jj20938842 19-Mar-22 6:49
 Re: Maximum Sum of Value of Positions Along a Path Gerry Schmitz19-Mar-22 7:12 Gerry Schmitz 19-Mar-22 7:12
 Re: Maximum Sum of Value of Positions Along a Path Jj2093884219-Mar-22 7:21 Jj20938842 19-Mar-22 7:21
 Re: Maximum Sum of Value of Positions Along a Path Gerry Schmitz19-Mar-22 7:57 Gerry Schmitz 19-Mar-22 7:57
 Re: Maximum Sum of Value of Positions Along a Path Jj2093884219-Mar-22 8:41 Jj20938842 19-Mar-22 8:41
 Special minimum spanning tree Andy Oct202116-Mar-22 11:35 Andy Oct2021 16-Mar-22 11:35
 Last Visit: 31-Dec-99 19:00     Last Update: 4-Dec-23 22:32 Refresh ᐊ Prev1234567891011 Next ᐅ