Tag: 내맘대로 강좌

 Week 6: Linear Lists – Simulated Pointer Representation6주차 선형 목록 : 포인터 시뮬레이트 표현법.Since we have midterm exams next week, I will give you an extremely easy assignment. I belive that this takes only a couple of hours.다음주에 시험이니까 매우쉬운 과제를 줄께, 난 이 과제가 2시간 정도 걸릴거라고 생각해. Section 7.7 introduces the concepts of더 보기 →

Week 6: Linear Lists – Simulated Pointer Representation Since we have midterm exams next week, I will give you an extremely easy assignment. I belive that this takes only a couple of hours. Section 7.7 introduces the concepts of the equivalent relationship and union set. Just type in the example code to find the union더 보기 →

Week 5: Linear Lists – Linked Representation 1. Write code for the class ChainWithSortMethods. ChainWithSortMethods 클래스를 만들어라 This class is a subclass of Chain and it includes the number method insertionSort, which uses insertion sort to reorder the chain elements into nondecreasing order.이 클래스는 Chain을 상속받는다. 그리고 인자의 크기를 오름차순 정렬하는 insertionSort 메소드를 갖고있다. =========================================================더 보기 →

Week 5: Linear Lists – Linked Representation 1. Write code for the class ChainWithSortMethods. ChainWithSortMethods 클래스를 만들어라 This class is a subclass of Chain and it includes the number method insertionSort, which uses insertion sort to reorder the chain elements into nondecreasing order.이 클래스는 Chain을 상속받는다. 그리고 인자의 크기를 오름차순 정렬하는 insertionSort 메소드를 갖고있다.Do not더 보기 →

Week 5: Linear Lists – Linked Representation 1. Write code for the class ChainWithSortMethods. This class is a subclass of Chain and it includes the number method insertionSort, which uses insertion sort to reorder the chain elements into nondecreasing order. Do not create new nodes or delete old ones. a) What is the worst-case time더 보기 →

1. Make an interface “StudentLinearList” as shown in Program 5.1.프로그램 5.1 에 있는것과 같이 StucentLinearList 인터페이스를 만들어라. Implement the “StudentArrayLinearList” class, which is an implementation of the interface “StudentLinearList”.StudentLinearList를 인터페이스로 갖는, StucentArrayLinearList클래스를 구현하여라. Modify the time measuring program, which was used in the last homework, by replacing the “Student” object array with the “StudentArrayList” class.지난번더 보기 →

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” +   더 보기 →