learn data structures c

(self) self.engine.accept (visitor) self.body.accept (Visito R) forWheelinchself.wheels:wheel.accept (visitor)#This is our visitor, and every change is here .classPrintvisitor:defVisitwheel (self, Wheel):Print "Visiting"+wheel.name+"Wheel" defVisitengine (self, Engine):Print "Visiting engine" defvisitbody (self, body):Print "Visiting Body" defVisitcar (self, car):Print "Visiting Car"if __name__=='__main__': Car=Car () visitor=printvisitor () car.accept (visitor)

, select the heap top record (maximum value), then rearrange the remaining records, then choose the heap top record (the next big value), and go down until there is only one record left in the heap.voidShiftheap (intArr[],intKintm) { inti =K; intj = i *2; while(J m) { if(J1]) J + +; if(arr[i]>Arr[j]) Break; Else{arr[0] =Arr[i]; Arr[i]=Arr[j]; I=J; J=2*i; } }}voidHeapsort (intArr[],intN) { intindex; for(index = n/2; index>=1; index--) Shiftheap (arr,index,n); for(index=1; index

fo = open ("./tmp/foo.txt","w+") Fo.write ("Python is a gerat language.\nyeah its great!! \ni am Zhang Yapeng, who is you?\n ") t_str = u' I am Zhang Yanpeng, what are you? ' Print (T_STR) Fo.write (T_STR) Fo.close () #read and Write FR = Open ("./tmp/foo1.txt","r+") FW = Open ("Foo_rw.txt","WB") Done = 0; LocalTime = Time.asctime (Time.localtime (Time.time ())) Print "Local Current time:", LocalTime Fw.write (localtime + "\ n") While not doing