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

0

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 Type of String
  • Count nodes in a linked list with given value
  • Concatenate Two Character Arrays
  • Check Palindrome Number
  • Convert Binary Tree to its Mirror Tree
  • Check whether two strings are anagram of each other
  • Check Armstrong Number
  • Pair in an Array with Given Sum
  • Find most Frequent Character in String
  • Top View of Binary Tree

Archives

More Articles

  • Remove All Blank Spaces in a String
  • Union and Intersection of two Linked Lists
  • Compute GCD of two Numbers
  • Check for balanced parentheses
  • Sort a Stack Using Temporary Stack

HELPMESTUDYBRO

  • About Us
  • Contact Us
  • Privacy Policy

Categories

Helpmestudybro © 2023. All Rights Reserved.

Powered by  - Designed with the Hueman theme