일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- 파이썬
- Object Oriented Programming
- 티스토리챌린지
- 알고리즘
- raw data
- 배열
- 포인터
- 반복문
- 함수
- array
- Data Science
- Pre-processing
- C++
- vscode
- 백준
- Deep Learning
- function
- pointer
- programming
- string
- predictive analysis
- Class
- assignment operator
- OOP
- Python
- 오블완
- baekjoon
- const
- pass by reference
- 문자열
- Today
- Total
목록2025/03 (25)
Channi Studies

Let's starty by creating a temporary database for this post. CREATE DATABASE test( my_date DATE, my_time TIME, my_datetime DATETIME);SELECT * from test; To get current date, time, or date time, there are 3 built-in functions, CURRENT_DATE(), CURRENT_TIME, and NOW()Let's try inserting a new row of appropriate data obtained by these functions. INSERT INTO testVALUES (CURRENT_DATE(), CURR..

Array–Based List An array-based list is a list ADT implemented using an array. An array-based list supports the common list ADT operations, such as append, prepend, insert after, remove, and search.In many programming languages, arrays have a fixed size. An array-based list implementation will dynamically allocate the array as needed as the number of elements changes. Initially, the array-based ..
Doubly-Linked List A doubly-linked list is a data structure for implementing a list ADT, where each node has data, a pointer to the next node, and a pointer to the previous node. The list structure typically points to the first node and the last node. The doubly-linked list's first node is called the head, and the last node the tail. (same as singly–linked lists)Same as the singly–linked list, d..

Singly-Linked List Singly-Linked List is a data structure for implementing a list ADT, where each node has data and a pointer to the next node. The list structure typically has pointers to the list's first node and last node, called the head and tail, respectively.A singly-linked list is a type of positional list: A list where elements contain pointers to the next and/or previous elements in the..