by Suf | Sep 25, 2024 | C++, DSA, Programming, Tips
Introduction Quick Sort is a highly efficient sorting algorithm developed by Tony Hoare in 1959. It employs a divide-and-conquer strategy to sort elements in an array or list. Quick Sort is renowned for its average-case time complexity of O(n log n), making it...
by Suf | Sep 24, 2024 | C++, Data Science, Programming, Tips
The Hamming distance measures the difference between two strings of equal length, typically used for binary sequences. It counts the number of positions where the corresponding bits or characters differ. This distance is widely used in error detection and correction...
by Suf | Sep 23, 2024 | C++, DSA, Programming, Python
Heap Sort is an efficient, comparison-based sorting algorithm that uses a binary heap data structure to sort elements in place. It offers a guaranteed time complexity of O(n log n) in all cases, making it reliable for large datasets. In this blog post, we’ll explain...
by Suf | Sep 22, 2024 | C++, DSA, Programming, Tips
How to Implement Shell Sort in C++ (With Code Example and Pseudocode) Shell Sort is a fast, comparison-based sorting algorithm that improves upon insertion sort by allowing comparisons between elements that are far apart. This C++ implementation follows the same...
by Suf | Oct 19, 2022 | C++, Finance, Programming, Tips
Implied volatility tells us the expected volatility of a stock over an option’s lifetime. Implied volatility is directly influenced by the supply and demand of the options and the market’s expectation of the direction of the price of the underlying security. As...
by Suf | Sep 30, 2022 | C++, Finance, Programming, Python, R, Tips
Options Greeks are a set of quantities representing an option’s price sensitivity to its underlying parameters. Each of them measures a different dimension of the risk in an option position. They fall out elegantly from derivatives of the Black-Scholes options...
