#Algorithms

Implement a polyfill for the Array.prototype.sort() method using Quick Sort. Explain how the recursion works in your implementation and what edge cases should be considered.

Write a function to determine if two strings are anagrams of each other. An anagram is a word or phrase formed by rearranging the letters of a different word or phrase. Provide the runtime complexity of your solution.

How would you implement a binary search algorithm? Please explain the logic behind it.

Write an algorithm to check if a given binary tree is a binary search tree (BST). Discuss the necessary properties of a BST that must be validated.

Implement an algorithm to detect a cycle in a linked list. You can use Floyd’s Tortoise and Hare algorithm for this purpose. If a cycle exists, return true; otherwise, return false.