Skip to content

Latest commit

 

History

History
60 lines (49 loc) · 2.26 KB

README.md

File metadata and controls

60 lines (49 loc) · 2.26 KB
Raw

.NET

Basic Algorithms Comparison in C#

Tests and compares the time the following algorithms need to perform their intended job

Array Search

  1. Linear Search
  2. Jump Search
  3. Binary Search
  4. Interpolation Search

Array Sorting

  1. Insertion Sort
  2. Selection Sort
  3. Bubble Sort
  4. Heap Sort
  5. Merge Sort
  6. Quick Sort

Trees

  1. Heap Tree
  2. BST Tree

Traversals

  1. Breadth First Traversal
  2. InOrder Traversal
  3. PostOrder Traversal
  4. PreOrder Traversal

Comparison for Search Algorithms

Comparison for Sort Algorithms

Comparison for Trees

Comparison for Traversals

Various Problems

  1. Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.
  2. Given a Matrix of size M x N. Your task is to print the matrix K times left rotated.
  3. 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].
  4. Problem described at https://practice.geeksforgeeks.org/problems/find-k-th-character-in-string/0
  5. Problem described at https://practice.geeksforgeeks.org/problems/maximum-tip-calculator/0
  6. Problem described at https://practice.geeksforgeeks.org/problems/check-if-array-contains-contiguous-integers-with-duplicates-allowed/0
  7. Problem described at https://practice.geeksforgeeks.org/problems/pairs-with-positive-negative-values/0