## Classic: Fibonacci Sequence

Question: Fibonacci sequence is a sequence of numbers where the number at position i is the sum of the numbers at positions i-1 and i-2. Please implement a function to output a Fibonacci sequence, as a list of length n with n as the input of the function. Assume that the first two elements of … Read more

## Classic: Bubble Sort

Question Please implement Bubble Sort. Answer Bubble Sort is a basic and simple sorting algorithm. It has O(n^2) complexity. 👍 Have fun while coding with Python! 👌 Please subscribe to receive notifications on future challenges. 💬 If you have any questions simply write a comment down below.

## Classic: Selection Sort

Question: Please implement Selection sort, which is a simple and basic sorting algorithm. It is not very fast. Its complexity is O(n^2). Answer: 👍 Have fun while coding with Python! 👌 Please subscribe to receive notifications on future challenges. 💬 If you have any questions simply write a comment down below.

## Classic: Quicksort

Question: Please implement Quicksort Answer: This answer below performs a Quicksort without in-place element swaps. Thus, it requires bigger memory space but results in simpler and easier-to-understand code implementation. Below is a code for Quicksort with in-place swapping. The code is a bit more involved than without in-place swapping (above), but it requires less memory … Read more