• Skip to primary navigation
  • Skip to content
  • Skip to footer
Hojin Yun Hojin Yun Navigator Floating in The Sea of Development
  • About Me
  • Projects
  • Studies
    1. Home
    2. /
    3. Algorithm & data structure
    4. /
    5. Sorting(정렬)
    • 😀 About Me
      • CV
    • ⚙️ Projects
      • RoboMaster Enterprise
      • Phone Comparison Website
    • 📒 Study
      • Algorithm & Data Structure
      • └ Sorting
      • └ Brute Force
      • └ Data Structure
      • └ Math
      • └ Dynamic Programming
      • Machine Learning
      • Computer Vision

    Sorting(정렬)

    January 26, 2022 less than 1 minute read

    정렬

    Counting Sort(선택 정렬)

    Merge Sort(병합 정렬)

    Sorting with O(N^2) Time Complexity(O(N^2)의 시간 복잡도를 가진 정렬)

    Tags: Sorting

    Categories: Algorithm & Data Structure

    Updated: January 26, 2022

    Share on

    Twitter Facebook LinkedIn
    Previous Next

    Leave a comment

    You may also enjoy

    그래프(Graph)

    July 15, 2022 1 minute read

    그래프

    Data Structure(자료구조)

    July 15, 2022 less than 1 minute read

    자료구조

    #4963: 섬의 개수

    July 15, 2022 2 minute read

    백준 4963번: 섬의 개수

    #2178: 미로 탐색

    July 15, 2022 2 minute read

    백준 2178번: 미로 탐색

    • Follow:
    • GitHub
    © 2023 Hojin Yun. Powered by Jekyll & Minimal Mistakes.