| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | 5 | 6 | |
| 7 | 8 | 9 | 10 | 11 | 12 | 13 |
| 14 | 15 | 16 | 17 | 18 | 19 | 20 |
| 21 | 22 | 23 | 24 | 25 | 26 | 27 |
| 28 | 29 | 30 | 31 |
- 배열
- 문자열
- predictive analysis
- Object Oriented Programming
- assignment operator
- 포인터
- raw data
- pass by reference
- pointer
- 알고리즘
- 오블완
- C++
- 백준
- Data Science
- Python
- programming
- function
- vscode
- Deep Learning
- string
- 파이썬
- 티스토리챌린지
- const
- 반복문
- Pre-processing
- array
- 함수
- OOP
- baekjoon
- Class
- Today
- Total
목록전체 글 (188)
Channi Studies
Database works like a folder, and table works like a file in SQL. We will work in the query window of MySQL Workbench Software, that can be accessed after succesfully connecting to MySQL server. Database To create a database, we use CREATE query (MySQL is not case-sensitive, meaning that you can use either CREATE, Create, create, CrEaTe, etc)CREATE DATABASE myDB; To use the created database, yo..
이번 포스트부터 매일 조금씩 SQL을 공부하는 프로젝트를 시작합니다. Relational Database Management System (RDBMS) software that manages and stores data in a structured format, using tables with rows and columns, and allows users to interact with the data using a structured query language (SQL). We will studying with MySQL, one of the most popular RDMBS used worldwide. Why We Use MySQL?✅ Structured Data Storage – MySQL is ..
Big O notation is a mathematical way of describing how a function (running time of an algorithm) generally behaves in relation to the input size. Given a function that describes the running time of an algorithm, the Big O notation for that function can be determined using the following rules:If f(N) is a sum of several terms, the highest order term (the one with the fastest growth rate) is kept ..
Upper and lower bounds An algorithm with runtime complexity: T(N) has a lower bound and an upper bound.Lower bound: A function f(N) that is ≤ the best case T(N), for all values of N ≥ 1.Upper bound: A function f(N) that is ≥ the worst case T(N), for all values of N ≥ 1.tip: when considering lower/upper bounds, just consider N = 1 Let's take a look on to an example. Say that the worst case of tim..