Fisher-Yates Shuffle Algorithm Implementation

This function takes a list as an argument and then randomly sorts it using the Fisher-Yates shuffle algorithm.

Technology Stack : random

Code Type : Function

Code Difficulty : Intermediate

                
                    
import random

def shuffle_list(input_list):
    if not isinstance(input_list, list):
        raise TypeError("input_list must be a list")
    
    for i in range(len(input_list) - 1, 0, -1):
        j = random.randint(0, i)
        input_list[i], input_list[j] = input_list[j], input_list[i]
    return input_list