seen from China
seen from United States
seen from China
seen from United States
seen from United States
seen from Singapore
seen from China
seen from Malaysia
seen from United States
seen from United Kingdom
seen from New Zealand
seen from Germany
seen from United States
seen from United States
seen from Malaysia
seen from United States
seen from United States
seen from Malaysia
seen from Mexico
seen from United States
Linear Search
Given an array of n elements. We have to write a function to search an item X in the given array Arr[n] Examples : Input : arr[] = {10, 20, 80, 30, 60, 50,110, 100, 130, 170}x = 110;Output : 6Element x is present at index 6 Input : arr[] = {10, 20, 80, 30, 60, 50,110, 100, 130, 170}x = 175;Output : -1Element x is not present in arr[]. A simple approach is to do a linear search , i.e Start…
View On WordPress
Tower of Hanoi Program in C
Tower of Hanoi Program in C
Tower of Hanoi is a mathematical puzzle where we have three towers and n disks. The objective of the puzzle is to move the entire stack to another tower, obeying the following simple rules: Only one disk can be moved at a time.Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack i.e. a disk can only be moved if it is the uppermost disk on a…
View On WordPress
