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

  • Merge Overlapping Intervals
  • Multiply Two Matrix
  • Count nodes in a linked list with given value
  • Sort an Array of 0s and 1s
  • Delete Complete Linked List
  • Introduction to Linked List
  • Check if Two Strings are Rotations of each other
  • Delete N Nodes After M Nodes of a Linked List
  • Check Armstrong Number
  • Find First Non-Repeating Character of the String

Archives

More Articles

  • Pair in an Array with Given Sum
  • Find Quotient and Remainder
  • Check Isogram String or Not
  • Copy One Character Array to Another Character Array
  • Octal to Decimal Conversion

HELPMESTUDYBRO

  • About Us
  • Contact Us
  • Privacy Policy

Categories

Helpmestudybro © 2025. All Rights Reserved.

Powered by  - Designed with the Hueman theme