php中的复杂排名

Question

我一直在与一个复杂的排名系统作斗争。排名取决于与分数无关的学生分数。积分计算对我来说没问题。打破平局时会出现问题，因为这取决于学生的分数，而这完全是一个不同的实体。学生可以有相似的分数，但分数不同，可以用来打破平局，以防某些学生在分数上打成平手。我需要帮助，因为我被卡住了。请参考我的图片以获得粗略的想法并告诉我是否可以完成。我还包含了我的一些代码。

<?php
$rank_by_point=array();
//loop out students and get their admission number from which you calculate individual points based on an algorithm
foreach($students as $student => $student_no){
 array_push($rank_by_point[$student_no],calculatePoints($student_no));
}
//sorting the points from highest to lowest
arsort($rank_by_point);

//the ranking code down here
$ties=array();
$break=array();
$initial_positions=array();
$rank = 0;
$last = false;
foreach($rank_by_point as $key => $value){
  if($last != $value){
     $last = $value;
     $rank++;                 
  }else{
    //when a tie is detected add the values to a tie array
    array_push($ties[$key],$rank);
  }
  array_push($initial_positions[$key],$rank);
}
//spliting of ties is done by getting marks and rearrangin the tie
foreach($ties as $admno => $st_rank){
  $read_position=$rank;//same value for all keys in the ties array
  $getmarks=getMarks($admno);
  array_push($break[$admno],$getmarks);
  //reorder the array in desc order
  arsort($break);
}
//reranking the ties. i got stuck here :-(
?>

Answer 1

1. 将学生分数作为较小的分数添加到calculatePoints($student_no)。例如

    function calculatePoints($student_no){
   
        /*add this before return it*/
   
        $point = $point*1000;//make sure the new $point be bigger than the max $student_mark
   
        $point += $student_mark;
   
        return $point;
    }
   

2. 像现在这样排序

Answer 2

编写一个比较标记的比较函数，并通过比较点来打破平局。然后用usort用这个函数对$students数组进行排序。

function compare_students($s1, $s2) {
    $p1 = calculatePoints($s1);
    $p2 = calculatePoints($s2);
    if ($p1 == $p2) {
        return getMarks($s1) - getMarks($s2);
    } else {
        return $p1 - $p2;
    }
}

usort($students, 'compare_students');