No description
  • C 95.8%
  • Makefile 4.2%
Find a file
2026-04-28 08:22:36 +02:00
ext/ft libft woopsises 2026-04-28 08:22:36 +02:00
source chain and instructions were ignored 2026-04-28 07:44:55 +02:00
tests nested gitignore & tests 2026-04-28 02:12:07 +02:00
.gitignore libft was getting ignored 2026-04-28 07:42:30 +02:00
Makefile make -bonus 2026-04-28 07:50:08 +02:00
README.md filled 42cv variables 2026-04-28 07:56:12 +02:00
template.mk finna manage to focus ;-; 2026-04-19 05:33:58 +02:00

This project has been created as part of the 42 curriculum by jmaxwell.

Push_swap

jmaxwell@42cursus/push_swap nogithub1 ai free content 2

description

in spite of the terminology in use throughout the subject, we are to sort, not stacks, but two way circular linked lists (doubly linked) of integers. such a structure is referred to as a chain throughout our codebase, rather than the misleading term "stack" favoured by the subject ; where a chain is thus a last in, first out circular buffer, supporting two way rotation on top of pushing and popping, as well as the nonelementary operations specific to the push_swap project. the term stack is only used here to refer specifically to the kind of object supporting the operations of said project.

subject3 project repository

bonus

no bonuses.

purpose

implementation

we went for a dead simple implementation of a radix sort.

instructions

usage

./push_swap [INTEGER]...
./push_swap "[INTEGER]..."...

one may call push_swap with a single argument containing multiple integers, or with multiple, each potentially containing multiple as well, or just one.

compilation

make

resources

peers

meaba

explaining radix to me

lchambos

helped with sorting smaller stacks

documentation

background


  1. do not mirror this repo or host a fork of it on github for reasons outlined here, none of the code present here should be hosted on github in any way, whether partially or totally. ↩︎

  2. the following is certified human labour the entirety of the code in this repo was designed, implemented and tested entirely by humans, without the involvement of llms at any stage of the process, besides during research in the form of unprompted search engine summaries. whenever possible, its use was avoided. any trace of ai involvement is either coincidental or accidental, and beyond my knowledge. ↩︎

  3. due to the policy currently in place at time of redaction, the unexplictly authorised publication of 42 subjects to individuals who may potentially lack the privilege to access them otherwise remains prohibited. as such, i will not be saving a copy of the relevant subject in this repository, however much i wish i could. ↩︎