Find the greatest among two numbers [Shell Program]



echo "Enter 1st number :\c"


read a


echo "Enter 2nd number :\c"


read b


if [ $a -gt $b ]


then


echo "$a greater than $b"


else


echo "$b less than $a"


fi





Comments

Post a Comment

Popular posts from this blog

Write a Program to Add two 3x3 Matrix using C

Image
#include<stdio.h> void main () { int a [ 3 ][ 3 ], b [ 3 ][ 3 ], s [ 3 ][ 3 ], i , j ; printf ( "Enter the values of 1st matrix" ); for ( i = 0 ; i < 3 ; i ++ ) { for ( j = 0 ; j < 3 ; j ++ ) { scanf ( "%d" , & a [ i ][ j ]); } } printf ( "Enter the values of 2nd matrix" ); for ( i = 0 ; i < 3 ; i ++ ) { for ( j = 0 ; j < 3 ; j ++ ) { scanf ( "%d" , & b [ i ][ j ]); } } for ( i = 0 ; i < 3 ; i ++ ) { for ( j = 0 ; j < 3 ; j ++ ) { s [ i ][ j ] = a [ i ][ j ] + b [ i ][ j ]; } } printf ( " \n The Sum is : \n " ); for ( i = 0 ; i < 3 ; i ++ ) { printf ( " \n\n " ); for ( j = 0 ; j < 3 ; j ++ ) { printf ( " \t %d" , s [ i ][ j ]); } ...
Read more

Stock Trading Profit Maximization Problem

You are given an array representing the daily price of a stock. Your task is to write a Java algorithm to determine the best day to buy and the best day to sell the stock to maximize your profit. You are only permitted to complete a single transaction (i.e., buy one and sell one share of the stock), and you must sell the stock after you buy it. Input: An array of integers where each integer represents the stock price on a given day. For example, consider the following array of stock prices: int[] prices = {3, 5, 6, 1, 7, 2, 10, 9, 3}; Output: Your algorithm should return the best day to buy and the best day to sell to maximize profit. The days should be zero-indexed, where day 0 is the first day. If no profit can be made, return an appropriate message or values indicating such. Example: Given the input array [3, 5, 6, 1, 7, 2, 10, 9, 3] , your algorithm should return: Buy on day 3, sell on day 6 This is because buying the stock for 1 on day 3 and selling it for 10 on day 6 yields a m...
Read more

Optimizing Web Applications for Read-Heavy Traffic

In the digital realm, where information is king, web applications frequently face the challenge of read-heavy traffic. This scenario is characterized by a significant majority of operations involving data retrieval rather than data modification or writing. Social media platforms, news aggregators, and e-commerce sites are prime examples, where the demand for fast and efficient data delivery is paramount. To keep up with such demands, developers and architects must employ strategic measures. Read-heavy traffic can strain the application’s resources, leading to slower response times and a degraded user experience. The key to managing this load is minimizing the time and resources required to serve each read request. Here are few strategies that can help achieve this. 1. Implementing Robust Caching Mechanisms Caching is the cornerstone of optimizing for read-heavy traffic. By storing a copy of frequently accessed data in memory, applications can serve future requests from this cache, dram...
Read more