Skip to content

예제코드 에러수정 #118

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
Danto7632 merged 1 commit into from
Nov 4, 2025
Merged

예제코드 에러수정 #118

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
5 changes: 2 additions & 3 deletions src/components/ide/mockData/codeExamples/insertionSort.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,5 +1,4 @@
const insertionSortExample = `#include <stdio.h>
#define MAX_SIZE 5

// 삽입 정렬
void insertion_sort(int list[], int n) {
Expand All @@ -21,8 +20,8 @@ void insertion_sort(int list[], int n) {

int main() {
int i;
int n = MAX_SIZE;
int list[n] = {5, 2, 4, 6, 1};
int n = 5;
int list[5] = {5, 2, 4, 6, 1};

// 삽입 정렬 수행
insertion_sort(list, n);
Expand Down
5 changes: 2 additions & 3 deletions src/components/ide/mockData/codeExamples/selectionSort.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,5 +1,4 @@
const selectionSortExample = `#include <stdio.h>
#define MAX_SIZE 5

// 선택 정렬
void selection_sort(int list[], int n) {
Expand All @@ -26,8 +25,8 @@ void selection_sort(int list[], int n) {

int main() {
int i;
int n = MAX_SIZE;
int list[n] = {64, 25, 12, 22, 11};
int n = 5;
int list[5] = {64, 25, 12, 22, 11};

// 선택 정렬 수행
selection_sort(list, n);
Expand Down