Skip to content

Helpmestudybro

  • Problems on Array
  • Problems on Matrix
  • Strings
  • Problems on Hashing
  • Linked List
  • Stacks
  • Binary Tree
  • Programming Examples

Helpmestudybro

  • Problems on Array
  • Problems on Matrix
  • Strings
  • Problems on Hashing
  • Linked List
  • Stacks
  • Binary Tree
  • Programming Examples

Tagged: searching

algorithms / arrays / data structure / searching

June 14, 2020

Linear Search

Linear Search is the simplest and easiest searching algorithm. Linear search algorithm works by simply finding the desired element from start to end of the list.  Linear search algorithm returns the index position of the element, if found in the list, else, returns false or invalid index position (i.e., -1)....

Follow:

Recent Posts

  • Print All Nodes of Binary Tree That Do not Have Siblings
  • Determine if two binary trees are identical or not
  • Print all Root to Leaf Paths in a Binary Tree
  • Convert Binary Tree to its Mirror Tree
  • Check if Binary Tree is Symmetric or Not
  • Delete Binary Tree
  • Check if two trees are mirror tree of each other
  • Top View of Binary Tree
  • Bottom View of Binary Tree
  • Vertical Traversal of Binary Tree

More Articles

  • Reverse a Linked List
  • Merge Two Sorted Arrays
  • Reverse an Array
  • Merge Two Sorted Linked List
  • Find most Frequent Character in String
  • Next Greater Element
  • Find Length of Loop of the Linked List
  • Delete Complete Linked List
  • Merge Overlapping Intervals
  • Implement Queue Using Stacks

Archives

More Articles

  • Check Whether String is Palindromic Anagram or Not
  • Print Kth Smallest and Kth Largest Element of an Array
  • Print all Palindromic Substrings of the given string – SET 1
  • Length of Longest Valid Substring
  • Convert Binary Tree to its Mirror Tree

HELPMESTUDYBRO

  • About Us
  • Contact Us
  • Privacy Policy

Categories

Helpmestudybro © 2026. All Rights Reserved.

Powered by  - Designed with the Hueman theme