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');