[Data Structure] 최소 힙 구현 - #177
Merged
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Summary
MinHeap클래스로 배열 기반 최소 힙을 직접 구현했습니다.push,pop,top과 함께siftUp,siftDown으로 최소 힙 조건을 유지합니다.size,capacity,empty,clear,reserve로 기본 상태 관리 인터페이스를 제공합니다.assert기반 테스트로 빈 힙, 중복값, 음수, 정렬 순서, 재사용 케이스를 검증합니다.Test
c++ -std=c++17 -Wall -Wextra -pedantic src/data_structure_implement/priority_structure/heap/minHeap.cpp -o /tmp/min_heap_check/tmp/min_heap_check→ALL TESTS PASSEDCloses #176