PaperDevil
/ README.md
Created
February 2, 2023 15:00
— forked from hofmannsven/README.md
MySQL CLI Cheatsheet
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
| npm install -g @vue/cli | |
| vue create vue-electron-app | |
| vue add vuetify | |
| vue add electron-builder | |
| npm install -D @types/electron-devtools-installer | |
| npm install -D @types/node@">=12.0.0 <13.0.0" | |
| npm install core-js@3 --save |
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
| def selection_sort(area): | |
| sorted = [] | |
| for i in range(len(area)): | |
| minimum = area.index(min(area)) | |
| sorted.append(area.pop(minimum)) | |
| return sorted |
PaperDevil
/ binary_search.py
Last active
February 2, 2020 18:13
Короткий алгоритм бинарного поиска.
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
| def binary_search(area, item): | |
| mid = len(area) // 2 | |
| low, high = 0, len(area) - 1 | |
| while low <= high: | |
| if area[mid] == item: return mid | |
| if item > area[mid]: low = mid + 1 | |
| else: high = mid - 1 | |
| mid = (low + high) // 2 | |
| return None |