• Skip to primary navigation
  • Skip to content
  • Skip to footer
zeomzzz dev-log
  • Home
  • Category
    zeomzzz

    zeomzzz

    zeomzzz의 TIL

    • Seoul, Korea
    • Email
    • GitHub
    • Framework
      • JPA(9)
      • SpringBoot(1)
      • Vue.js(1)
      • React.js(1)
      • Express.js(1)
    • Language
      • Java(5)
      • Javascript(2)
      • SQL(1)
      • NoSQL(0)
    • Algorithm
      • Algorithm(14)
      • Problem Solving(14)
    • Others
      • Computer Science(6)
      • Web(11)
      • Infra(5)
      • Tools(1)
      • Git(1)
    • Etc
      • Blog(1)

    Backtracking

    May 7, 2023

    On this page

    • 백트래킹
      • 시간 복잡도
      • 코드 구조


    백트래킹



    시간 복잡도


    • 중복 가능 : O(N ^ N)
    • 중복 불가능 : O(N!)



    코드 구조


    def backtracking(result, depth) :
    	# base
        if :
        	return
        
        # recursive
        for i in range(N) :
        	backtracking(result, depth + 1)
            # 원복 코드
    

    Tags: Algorithm, Backtracking

    Categories: Algorithm

    Updated: May 7, 2023

    Previous Next

    Leave a comment

    You may also enjoy

    [BOJ/Java] 14718 용감한 용사 진수 - 요소에 대해 완전탐색

    December 29, 2023

    RESTful API란?

    December 29, 2023

    [PGM/Java] 42895 N으로 표현

    December 17, 2023

    멀티 프로세스와 멀티 스레드

    December 17, 2023

    • Follow:
    • GitHub
    • Feed
    © 2023 zeomzzz. Powered by Jekyll & Minimal Mistakes.