Coder Social home page Coder Social logo

piscine's Introduction

42 Seoul Piscine

2020.01.20 ~ 2020.02.14 기간 내, C Piscine 과정의 모든 프로젝트

(채점 서버에서 전부 통과한 코드이지만 팀과제 제외, 비효율적인 부분이 다소 존재할 수 있습니다.)

Shell00

ko.subject.pdf

en.subject.pdf

Exercise 00 : Z

Exercise 01 : testShell00

Exercise 02 : Oh yeah, mooore...

Exercise 03 : Connect me!

Exercise 04 : midLS

Exercise 05 : GiT commit

Exercise 06 : gitignore

Exercise 07 : dif

Exercise 08 : clean

Exercise 09 : Illusions, not tricks, Michael...

Shell01

ko.subject.pdf

en.subject.pdf

Exercise 01 : print_groups

Exercise 02 : find_sh

Exercise 03 : count_files

Exercise 04 : MAC

Exercise 05 : Can you create it ?

Exercise 06 : Skip

Exercise 07 : r_dwssap

Exercise 08 : add_chelou

C00

ko.subject.pdf

en.subject.pdf

Exercice 00 : ft_putchar

Exercise 01 : ft_print_alphabet

Exercise 02 : ft_print_reverse_alphabet

Exercise 03 : ft_print_numbers

Exercise 04 : ft_is_negative

Exercise 05 : ft_print_comb

Exercise 06 : ft_print_comb2

Exercise 07 : ft_putnbr

Exercise 08 : ft_print_combn

C01

ko.subject.pdf

en.subject.pdf

Exercise 00 : ft_ft

Exercise 01 : ft_ultimate_ft

Exercise 02 : ft_swap

Exercise 03 : ft_div_mod

Exercise 04 : ft_ultimate_div_mod

Exercise 05 : ft_putstr

Exercise 06 : ft_strlen

Exercise 07 : ft_rev_int_tab

Exercise 08 : ft_sort_int_tab

C02

ko.subject.pdf

en.subject.pdf

Exercise 00 : ft_strcpy

Exercise 01 : ft_strncpy

Exercise 02 : ft_str_is_alpha

Exercise 03 : ft_str_is_numeric

Exercise 04 : ft_str_is_lowercase

Exercise 05 : ft_str_is_uppercase

Exercise 06 : ft_str_is_printable

Exercise 07 : ft_strupcase

Exercise 08 : ft_strlowcase

Exercise 09 : ft_strcapitalize

Exercise 10 : ft_strlcpy

Exercise 11 : ft_putstr_non_printable

Exercise 12 : ft_print_memory

C03

ko.subject.pdf

en.subject.pdf

Exercise 00 : ft_strcmp

Exercise 01 : ft_strncmp

Exercise 02 : ft_strcat

Exercise 03 : ft_strncat

Exercise 04 : ft_strstr

Exercise 05 : ft_strlcat

C04

ko.subject.pdf

en.subject.pdf

Exercise 00 : ft_strlen

Exercise 01 : ft_putstr

Exercise 02 : ft_putnbr

Exercise 03 : ft_atoi

Exercise 04 : ft_putnbr_base

Exercise 05 : ft_atoi_base

C05

ko.subject.pdf

en.subject.pdf

Exercise 00 : ft_iterative_factorial

Exercise 01 : ft_recursive_factorial

Exercise 02 : ft_iterative_power

Exercise 03 : ft_recursive_power

Exercise 04 : ft_fibonacci

Exercise 05 : ft_sqrt

Exercise 06 : ft_is_prime

Exercise 07 : ft_find_next_prime

Exercise 08 : The Ten Queens

C06

ko.subject.pdf

en.subject.pdf

Exercise 00 : ft_print_program_name

Exercise 01 : ft_print_params

Exercise 02 : ft_rev_params

Exercise 03 : ft_sort_params

C07

ko.subject.pdf

en.subject.pdf

Exercise 00 : ft_strdup

Exercise 01 : ft_range

Exercise 02 : ft_ultimate_range

Exercice 03 : ft_strjoin

Exercise 04 : ft_convert_base

Exercise 05 : ft_split

C08

ko.subject.pdf

en.subject.pdf

Exercise 00 : ft.h

Exercise 01 : ft_boolean.h

Exercise 02 : ft_abs.h

Exercise 03 : ft_point.h

Exercise 04 : ft_strs_to_tab

Exercise 05 : ft_show_tab

C09

ko.subject.pdf

en.subject.pdf

Exercise 00 : libft

Exercise 01 : Makefile

Exercise 02 : ft_split

C10

ko.subject.pdf

en.subject.pdf

Exercise 00 : display_file

Exercise 01 : cat

Exercise 02 : tail

Exercise 03 : hexdump

C11

ko.subject.pdf

en.subject.pdf

Exercise 00 : ft_foreach

Exercise 01 : ft_map

Exercise 02 : ft_any

Exercise 03 : ft_count_if

Exercise 04 : ft_is_sort

Exercise 05 : do-op

Exercise 06 : ft_sort_string_tab

Exercise 07 : ft_advanced_sort_string_tab

C12

ko.subject.pdf

en.subject.pdf

Exercice 00 : ft_create_elem

Exercice 01 : ft_list_push_front

Exercice 02 : ft_list_size

Exercice 03 : ft_list_last

Exercice 04 : ft_list_push_back

Exercice 05 : ft_list_push_strs

Exercice 06 : ft_list_clear

Exercice 07 : ft_list_at

Exercice 08 : ft_list_reverse

Exercice 09 : ft_list_foreach

Exercice 10 : ft_list_foreach_if

Exercice 11 : ft_list_find

Exercice 12 : ft_list_remove_if

Exercice 13 : ft_list_merge

Exercice 14 : ft_list_sort

Exercice 15 : ft_list_reverse_fun

Exercice 16 : ft_sorted_list_insert

Exercice 17 : ft_sorted_list_merge

C13

ko.subject.pdf

en.subject.pdf

Exercise 00 : btree_create_node

Exercise 01 : btree_apply_prefix

Exercise 02 : btree_apply_infix

Exercise 03 : btree_apply_suffix

Exercise 04 : btree_insert_data

Exercise 05 : btree_search_item

Exercise 06 : btree_level_count

Exercise 07 : btree_apply_by_level

piscine's People

Contributors

whrlgus avatar

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.