Category: 생활

1. Make an interface “StudentLinearList” as shown in Program 5.1. Implement the “StudentArrayLinearList” class, which is an implementation of the interface “StudentLinearList”. Modify the time measuring program, which was used in the last homework, by replacing the “Student” object array with the “StudentArrayList” class. 2. Extend “StudentArrayLinearList” to include the method “removeRange”, which removes all더 보기 →

1. Now we have four sorting algorithm implementations, which were originated from the 2nd week homework.이제 우리는 2번째 과제의 4개의 정렬 알고리즘을 갖고있다.This is the time for asymptotically analyze each program. Of course, you have to analyze them under best, worst and average cases.이번엔 점근적인(asymptotically) 분석을 해보자. 물논, 최악, 최적, 평균적인 사건에 대해 분석해야 된다.더 보기 →

1. Now we have four sorting algorithm implementations, which were originated from the 2nd week homework. This is the time for asymptotically analyze each program. Of course, you have to analyze them under best, worst and average cases. 2. Since we have the actual implementations, we can measure the execution time of them. As we더 보기 →

===================================================================================================RankSort 분석=================================================================================================== [#M_일단 Rank Sort 알고리즘의 소스를 보자.|닫기..|교재 80p를 보면 대략 [code java]    public static void rank(Comparable [] a, int [] r)    {        if(r.length < a.length)            throw new IllegalArgumentException                     (“length of rank array cannot” +   더 보기 →

===================================================================================================문제 분석=================================================================================================== 음,, 일단 랭크소트가 무엇인지를 파악해야겠군,,,최형이라면 알지도 모르지만, 혼자 해보는것도 재미있을것 같다,,문제는 시간. 시간 복잡도의 경우도 “counting the comparison operations(비교 연산자 갯수 세기)”는 쉬운데 “counting the steps with the s/e and frequency table(스텝을 세어서 빈도분석)”법은,,,,, 서의성 교수님 시간이었지만, 전날 무리하는 바람에 못들었다.. 공부할게 많네,,, 공간 사용에 대해서는 보통 정렬의 경우에 공간은 거의 차지하지 않지,더 보기 →

===================================================================================================번역=================================================================================================== 1. Our textbook introduces another sorting algorithm called rank sort at page 80.1. 우리의 교제에서는 또다른 정령 알고리즘인 rank정렬을 80페이지에서 소개하고 있다.Make a rank sort program that sorts students by their name and print their scores along side the names in the sorted order.Rank정렬을 이용하여 학생들을 그들의 이름으로 정렬하고, 그들의 점수를 정렬된 이름옆에 표시하는더 보기 →

1. Our textbook introduces another sorting algorithm called rank sort at page 80. Make a rank sort program that sorts students by their name and print their scores along side the names in the sorted order. Student names and scores must be included in a Student object. The data are input through keyboard and the더 보기 →