René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"[Week 6] SORTGAME self review - ChaeheeKang-GitHub","articleBody":"# SORTGAME self review ![](https://img.shields.io/badge/-WA-%23e00000)\r\n\r\n## 1. 해결 시도 과정\r\n크기 비교를 위해 대소관계를 기준으로 일반화 하는 과정을 마쳤습니다.\r\n\r\n## 2. 작성한 코드와 설명\r\n```py3\r\ndef genralize(sortgame):\r\n    l=len(sortgame)\r\n    for i in range(N):\r\n        smaller=0\r\n        for j in range(N):\r\n            if sortgame[j]\u003csortgame[i]:\r\n                samller+=1\r\n        fixed[i]=smaller\r\n    return ''.join(str(i) for i in arr)\r\n```\r\n\r\n\r\n## 3. 막힌 점 및 개선 사항\r\nbfs부분이 막혔습니다. 현재까지 진행한 상태는 다음과 같습니다.\r\n```py3\r\ndef bfs(start,length):\r\n    queue=deque()\r\n    queue.append((start,0))\r\n    \r\n    while queue:\r\n        now,level=queue.popleft()\r\n        \r\n        for i in range(len(now)):\r\n            for j in range(i+1,len(now)):\r\n                now[i:j+1]=now[i:j+1][::-1]\r\n                string=''.join(now)\r\n                            \r\n```","author":{"url":"https://github.com/chaeheekang","@type":"Person","name":"chaeheekang"},"datePublished":"2022-03-03T13:43:21.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":0},"url":"https://github.com/188/Advanced-Algorithm-Study/issues/188"}