Skip to content

String Pattern Matching, Heap Sort, Minimum Spanning Tree - Sogang University Data Structure Assignments

Notifications You must be signed in to change notification settings

bbangjee/cse3080_data_structures

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1 Commit
 
 
 
 
 
 
 
 

Repository files navigation

CSE3080 자료구조 (2024년 봄학기)

서강대학교 자료구조 수업 과제 모음

📚 수업 정보

  • 과목명: CSE3080 자료구조
  • 학기: Spring 2024

📁 폴더 구조

cse3080_data_structures/
├── hw01/                    # String Pattern Matching
│   ├── hw1_naive.c          # Naive Algorithm Implementation
│   ├── hw1_kmp.c            # KMP Algorithm Implementation
│   └── Makefile
├── hw02/                    # Heap Sort
│   ├── hw2.c                # Min/Max Heap Implementation
│   └── Makefile
├── hw03/                    # Minimum Spanning Tree
│   ├── hw3.c                # Kruskal's Algorithm Implementation
│   └── Makefile
└── README.md

🎯 과제 목록

HW01: String Pattern Matching

  • 주제: 패턴 매칭 알고리즘 구현
  • 알고리즘:
    • Naive Algorithm (O(mn) time complexity)
    • KMP Algorithm (O(m+n) time complexity)

HW02: Heap Sort

  • 주제: 힙 자료구조와 정렬
  • 구현: Min heap and Max heap
  • 명령어: INSERT, ASCEND, DESCEND

HW03: Minimum Spanning Tree

  • 주제: 그래프 알고리즘 - 크루스칼 알고리즘을 이용한 최소 신장 트리
  • 알고리즘: Kruskal's Algorithm with O(e log n) complexity

About

String Pattern Matching, Heap Sort, Minimum Spanning Tree - Sogang University Data Structure Assignments

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published