SebastiaoJeronimo/push_swap

implementing a algorithm to order two stacks (implemented with linked lists) main focus is temporal complexity of the operations

push_swap

implementing a algorithm to order two stacks (implemented with linked lists) main focus is the temporal complexity of the operations

Table of Contents

• stack operations
• Algorithm
  • radix sort
• Contributing
• License

stack operations

operation swap (swaps the fist two elements of the stack)

implementation of the swap operation
Temporal complexity O(1)

opertaion push (takes the first element of a stack and puts it on the top of the other)

implementation of the push operation
Temporal complexity O(1)

operation rotate (the first element becomes the last one)

implementation of the rotate opertion
Temporal complexity O(n)

operation reverse rotate (the last element becomes the first one)

implementation of the reverse rotate opertion
Temporal complexity O(n)

Algorithm

To solve the problem i implemented the radix sort algorithm

radix_sort

...

Example 2

...

Contributing

...

License

...