Ignou Solved Assignments

Question 1: Describe an algorithm for finding both the largest and the smallest integers in a finite sequence of integers in an array and count them how many comparison operation are involved. Solution:- C code to find largest and smallest number in an array #include<stdio.h> int main() {   int a[50], size, i, big, small, count...