第9优先队列和堆排序110实现最小

阶段三· 老师1对1的作业1-10实现最小堆动的逻辑，只有siftUp和siftDown两个函数，当然，一些函数明要发生变化，比如findMax要改成findMin，extractMax要改成extractMin。importpublicclassMinHeap<EextendsComparable<E>>privateArray<E>publicMinHeap(intcapacity){data=new}publicdata=new}publicMinHeap(E[]arr){data=newif(arr.length!=1){for(inti=parent(arr.length-1);i>=0;i--)}}//publicintreturn}//返回一个布尔值,publicbooleanisEmpty(){return}//privateintparent(intindex){if(index==0)thrownewgrmtEet("ne-0doesn'thaveparent.");return(index-1)/2;}//privateintindex){returnindex*2+}//privateintindex){returnindex*2+}//publicvoide){data.addLast(e);siftUp(data.getSize()-1);}privatevoidsiftUp(int//while(k>0&&data.get(parent(k)).compareTo(data.get(k))>0){data.swap(k,parent(k));k=}}////publicfindMin(){if(data.getSize()==0)thrownewIllegalArgumentException("CannotfindMaxwhenheapisempty.");returndata.get(0);}//publicEEret=data.swap(0,data.getSize()-1);return}privatevoidsiftDown(intwhile(leftChild(k)<intj=leftChild(k);//在此轮循环中,data[k]和data[j]//if(j+1<data.getSize()data.get(j+1).compareTo(data.get(j))<0)j++;//data[j]leftChildrightChild//if(data.get(k).compareTo(data.get(j))<=0)data.swap(k,k=}}epublicErece(Ee){Eret=findMin();data.set(0,e);returnret;}publicstaticvoidmain(String[]args)intn MinHeap<Integer>minHeap=newMinHeap<>();Randomrandom=newRandom();for(inti=0;i<n;i++)minHeap.add(random.nextInt(Integer.MAXVALUE));int[]arr=newint[n];for(inti=0;i<n;i++)arr[i]=for(inti=1;i<n;i++)if(arr[i-1]>arr[i])thrownewSystem.out.println("TestMinHeap}}main函数，如果大家的最小堆实