Skip to content
BranchesTags

Latest commit

 

History

42 Commits

Folders and files

NameName
Last commit message
Last commit date
Makefile
Makefile
 
 
clean_joined_str.c
clean_joined_str.c
 
 
find_smallest_node.c
find_smallest_node.c
 
 
find_smallest_node_index.c
find_smallest_node_index.c
 
 
free_list.c
free_list.c
 
 
free_strs.c
free_strs.c
 
 
init_list.c
init_list.c
 
 
is_sorted_ascending.c
is_sorted_ascending.c
 
 
micro_utils.c
micro_utils.c
 
 
parsing.c
parsing.c
 
 
parsing_utils.c
parsing_utils.c
 
 
ps_atoi_safe.c
ps_atoi_safe.c
 
 
ps_lst_add_back.c
ps_lst_add_back.c
 
 
ps_lst_max.c
ps_lst_max.c
 
 
ps_lst_new.c
ps_lst_new.c
 
 
ps_lst_size.c
ps_lst_size.c
 
 
ps_split.c
ps_split.c
 
 
ps_strdup.c
ps_strdup.c
 
 
ps_strjoin.c
ps_strjoin.c
 
 
ps_strlen.c
ps_strlen.c
 
 
push.c
push.c
 
 
push_swap.c
push_swap.c
 
 
push_swap.h
push_swap.h
 
 
radix.c
radix.c
 
 
radix_utils.c
radix_utils.c
 
 
reverse_rotate.c
reverse_rotate.c
 
 
rotate.c
rotate.c
 
 
sort_2.c
sort_2.c
 
 
sort_3.c
sort_3.c
 
 
sort_4.c
sort_4.c
 
 
sort_5.c
sort_5.c
 
 
sort_stack.c
sort_stack.c
 
 
swap.c
swap.c
 
 

About

This project will make you sort data on a stack, with a limited set of instructions, using the lowest possible number of actions. To succeed you’ll have to manipulate various types of algorithms and choose the most appropriate solution (out of many) for an optimized data sorting.

Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

Packages

Contributors

Languages