根据点赞点踩数量倒序排序,先random乱序

src/main/java/edu/nju/service/HistoryService.java

@@ -95,6 +95,7 @@ public class HistoryService {
 
 	//单一状bug热度排序
 	public void hotSortSingle(List<String> ids){
+	    Collections.shuffle(ids);
 		ids.sort(new Comparator<String>() {
 			public int compare(String id1, String id2) {
 				BugMirror bugMirror1=mirrordao.findById(id1);
@@ -106,6 +107,7 @@ public class HistoryService {
 
 	//树状bug热度排序
 	public void hotSortTree(List<String> ids){
+        Collections.shuffle(ids);
 		ids.sort(new Comparator<String>() {
 			public int compare(String id1, String id2) {
 				int hot1= getTreeHot(id1);