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: 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

  • Check Palindrome Number
  • Hexadecimal to Octal Conversion
  • Top View of Binary Tree
  • Postfix to Prefix Conversion
  • Implement Stack Using Linked List
  • Find mean of an Array
  • Prefix to Postfix Conversion
  • Reverse a Linked List
  • Transpose of a Matrix
  • Segregate Even and Odd Nodes in a Linked List

Archives

More Articles

  • Count Number of Vowels and Consonants in the String
  • Print All Substrings of a String
  • Octal to Hexadecimal Conversion
  • Sort an Array of 0s and 1s
  • Check Whether String is Palindrome or not

HELPMESTUDYBRO

  • About Us
  • Contact Us
  • Privacy Policy

Categories

Helpmestudybro © 2025. All Rights Reserved.

Powered by  - Designed with the Hueman theme