Skip to main content
Home
  • Home
  • Learn
    • Courses
      • Programming in C
      • Operating Systems
      • Mathematics
      • Digital Logic Design
      • Database Management System
      • Data Structures
      • Computer Organisation
      • Computer Networks
      • Compiler design
      • Algorithms
      • Theory of Computation
  • Practise
    • Doubts
    • Solved Examples
    • Virtual GATE
  • Quiz
  • Class Rooms
  • Blog
  • More
    • Reach to us
      • Contact Us
      • Request a Topic
      • Join us
      • Internship
      • Teach with Techtud
      • GATE 2018 Feedback
    • Your Interview
      • Professor's Interview
      • Research Scholar's Interview
      • Exam topper's interview
    • About
      • About Techtud
      • The Team
      • User Levels and Credentials
      • Benefits
      • Earn Techtud Tee
Algorithms
  • Complexity Analysis
    • Introduction to Asymptotic Notations
    • Time Complexity
      • Analysis of Iterative Programs
      • Analysis of Recursive Programs
    • Comparision of Complexities
    • Master's Theorem
    • Space Complexity
  • Sorting
    • Sorting Techniques
    • Insertion Sort
    • Merge Sort
    • Quick Sort
    • Bubble Sort
    • Selection Sort
    • Heap Sort
      • Introduction to Heaps
      • Max Heapify Algorithm
      • Building of a Heap
      • Heap Sort & its Analysis
  • Searching
    • Linear Search
    • Binary Search
  • Hashing
    • Direct Address Table (DAT)
    • Open Addressing
      • Linear Probing
      • Quadratic Probing
      • Double Hashing
    • Chaining
  • Graph Algorithms
    • Shortest Path Algorithm
    • Minimal Spanning Tree
    • Kruskal's Algorithm
    • Prim's Algorithm
  • Algorithm Design Techniques
    • Greedy Algorithms
      • Fractional Knapsack Problem
      • Minimum Cost Spanning tress
        • Prim's Algorithm
        • Kruskal's Algorithm
      • Single Source Shortest Path
      • Huffman Codes
      • Optimal Merge Patterns
    • Divide and Conquer Algorithm
    • Dynamic Programming
      • Matrix Chain Multiplication
      • 0/1 Kanpsack Problem
      • Subset Sum Problem
      • Travelling Salesman Problem
      • All Pair Shortest Path
  • Complexity Theory
    • Types of Algorithms
    • Introduction to P and NP Classes
    • Polynomial Time Reduction Algorithms
    • NP Hard & NP Complete Problems
  • Notes
  • Video
  • Example
  • Resource
  • Doubts
  • Quiz
Previous
Next
  • Finding complexity of Iterative Program
  • Sumit Verma
  • 2 years 7 months ago
  • 42

Quick Links

  • Doubts

About

  • The Team
  • User Levels & Credentials

Reach to Us

  • Contact Us
  • Join Us
  • Request a Topic

Media Coverage

TOI
YS
BS

Subscribe

Proudly supported by OpenSense Labs