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

Category: algorithms

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

  • Count All Occurrences of an Element in an Array
  • Octal to Hexadecimal Conversion
  • Next Greater Element
  • Convert Binary Tree to its Mirror Tree
  • Hexadecimal to Decimal Conversion
  • Convert Lowercase to Uppercase and Vice Versa
  • Print all Palindromic Substrings of the given string – SET 1
  • Concatenate Two Character Arrays
  • Print Fibonacci Series up to Nth Term
  • Print all Root to Leaf Paths in a Binary Tree

Archives

More Articles

  • Swap Kth Element from Beginning with Kth element from end
  • Delete N Nodes After M Nodes of a Linked List
  • Implement Two Stacks in a Single Array
  • Compute Height of a Binary Tree
  • Detect and Remove Loop in the Linked List

HELPMESTUDYBRO

  • About Us
  • Contact Us
  • Privacy Policy

Categories

Helpmestudybro © 2026. All Rights Reserved.

Powered by  - Designed with the Hueman theme