问最大效能的排序组合

EN

+----User_Details------+  //You may or may not need this
| UID | Particulars... |
+----------------------+

+----User_Timeslots---------+  //Time slots per collumn
| UID | SlotNumber(bool)... |  //true/false if the user is avaliable
+---------------------------+  //SlotNumber is replaced by s1, s2, etc

+----User_Arrangements--------+  //Time slots per collumn
| UID | SlotNumber(string)... |  //Group session string
+-----------------------------+

/**
* Randomise a session, in which data is not yet set
**/
function randomizeSession( sesionID ) {
    for( var id = [lowest UID], id < [highest UID], id++ ) {
        if( id exists ) {
            randomizeSingleSession( id, sessionID );
        } //else skips
    }
}

/**
* Randomizes a single user in a session, without conflicts in previous sessions
**/
function randomizeSingleSession( id, sessionID ) {

    convert sessionID to its collumns name =)
    get the collumns name of all ther previous session

    if( there is data, false, or JSON ) {
        Does nothing (Already has data)
    }

    if( ID is avaliable in time slot table (for this session) ) {
        Get all IDs who are avaliable, and contains no data this session
        Get all the UID previous session
        while( first time || not yet resolved ) {
            Randomly chose 2
            if( there was conflict in UID previous session ) {
                try again (while) : not yet resolved
            } else {
                resolved
            }
        }

        Registers all 3 users as a group in the session

    } else {
        Set session result to false (no attendance)
    }
}

/* Array with profs (this is one dimensional here for the show, but I assume
it will be multi-dimensional, filled with availability and what not;
For the sake of this example, let me say that the multi-dimensional array
contains the following keys: [id]{[avail_from],[avail_to],[last_ses],[name]}*/
$profs = array_fill(0, $prof_num, "assoc_ids");

// Array with time slots, let's say UNIX stamps of begin time
$times = array_fill(0, $slot_num, "time");

// First, we need to loop through all the time slots
foreach ($times as $slot) {

    // See when session ends
    $slot_end = $slot + $session_time;

    // Now, run through the profs to see who's available
    $avail_profs = array(); // Empty
    foreach ($profs as $prof_id => $data) {

        if (($data['avail_from'] >= $slot) && ($data['avail_to'] >= $slot_end)) {

            $avail_prof[$prof_id] = $data['last_ses'];

        }

    }

    /* Reverse sort the array so that the highest numbers (profs who have been
    waiting the longest) will be up top */
    arsort($avail_profs);
    $profs_session = array_slice($avail_profs, 0, 3);
    $profs_session_names = array(); // Empty

    // Reset the last_ses counters on those profs
    foreach ($profs_session as $prof_id => $last_ses) {


        $profs[$prof_id]['last_ses'] = 0;
        $profs_session_names[0] = $profs[$prof_id]['name'];

    }

    // Now, loop through all profs to add one to their waiting time
    foreach ($profs as $prof_id = > $data) {

       $profs[$prof_id]['last_ses']++;

    }

    print(sprintf('The %s session will be held by: %s, $s, and %s<br />', $slot,
                   $profs_session_names[0], $profs_session_names[1],
                   $profs_session_names[2]);

    unset ($profs_session, $profs_session_names, $avail_prof);

}

The 9:40am session will be held by: C. Hicks, A. Hole, and B.E.N. Dover