Basic Algorithms Comparison in C#
Tests and compares the time the following algorithms need to perform their intended job
Array Search
- Linear Search
- Jump Search
- Binary Search
- Interpolation Search
Array Sorting
- Insertion Sort
- Selection Sort
- Bubble Sort
- Heap Sort
- Merge Sort
- Quick Sort
Trees
- Heap Tree
- BST Tree
Traversals
- Breadth First Traversal
- InOrder Traversal
- PostOrder Traversal
- PreOrder Traversal
Comparison for Search Algorithms
Comparison for Sort Algorithms
Comparison for Trees
Comparison for Traversals
Various Problems
- Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.
- Given a Matrix of size M x N. Your task is to print the matrix K times left rotated.
- Given two integers ‘L’ and ‘R’, write a program that finds the count of numbers having prime number of set bits in their binary representation in the range [L, R].
- Problem described at https://practice.geeksforgeeks.org/problems/find-k-th-character-in-string/0
- Problem described at https://practice.geeksforgeeks.org/problems/maximum-tip-calculator/0
- Problem described at https://practice.geeksforgeeks.org/problems/check-if-array-contains-contiguous-integers-with-duplicates-allowed/0
- Problem described at https://practice.geeksforgeeks.org/problems/pairs-with-positive-negative-values/0