Shell Script to Print Numbers in Descending Order - The Coding Shala

Home >> Scripting >> Descending order of a number

Shell Script to Print Numbers in Descending Order

Write a shell script to print numbers in descending order using a while loop?

Code: 

#!/bin/bash
i=5
while test  $i != 0
do 
echo "$i"
i=`expr $i - 1`
done



Other Posts You May Like
Please leave a comment below if you like this post or found some error, it will help me to improve my content.
By

Comments

Post a Comment

Popular Posts from this Blog

Longest Substring Without Repeating Characters Java Program - The Coding Shala

Home >> Interview Questions >> Longest Substring without repeating characters Longest Substring Without Repeating Characters Java Program In this post, you will learn how to find the length of the longest substring without repeating characters in a string and its Java solution. Given a string, find the length of the longest substring without repeating characters. Example 1: Input: "abcabcbb" Output: 3 Explanation: The answer is "abc", with a length of 3. Example 2: Input: "bbbbb" Output: 1 Explanation: The answer is "b", with a length of 1. Example 3: Input: "pwwkew" Output: 3 Java Solution of Longest Substring without Repeating Characters Approach 1: Using brute force by checking all the substrings.  We'll use HashSet to check if characters are unique or not. Time complexity: O(n^2) Space Complexity: O(n) Java Program:  class Solution { public i...
Read more

Anti Diagonals - The Coding Shala

Image
Home >> Interview Questions >> Anti Diagonals Anti Diagonals Java Solution Give an N*N square matrix, return an array of its anti-diagonals. Look at the example for more details. Example: Input: 1 2 3 7 8 9 4 5 6 Return the following : [ [1], [2, 4], [3, 5, 7], [6, 8], [9] ] Input : 1 2 3 4 Return the following : [ [1], [2, 3], [4] ] Anti Diagonals Java Solution 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 public class Solution { public ArrayList < ArrayList < Integer >> diagonal ( ArrayList < ArrayList < Integer >> A ) { ArrayList < ArrayList < Integer >> ans = new ArrayList < ArrayList < Integer >>(); int N = A . size (); int i = N - 1 ; while ( i >= 0 ){ ArrayList < Integer > tmp = new ArrayList < Integer >(); ...
Read more

First Missing Positive Solution - The Coding Shala

Home >> Interview Prep >> First missing positive  In this post, we will learn how to solve the First Missing Positive problem and will implement its solution in Java. First Missing Positive Problem Given an unsorted integer array nums, find the smallest missing positive integer. You must implement an algorithm that runs in O(n) time and uses constant extra space. Example 1: Input: nums = [1,2,0] Output: 3 Example 2: Input: nums = [3,4,-1,1] Output: 2 First Missing Positive Java Solution Approach 1 Time Complexity: O(n) Space Complexity: O(1) The steps are below to solve this problem: Step 1: The first missing positive number will be in the range of 1 to N+1, where N is the length of the array. So Other than these numbers we can ignore, make this change in the array. Step 2: Now we will take the array elements as the index(their original position), and at the numbers' original position will make the array element negative so later we can check this number ...
Read more

Java Program to Reverse a String using Stack - The Coding Shala

Home >> Java Programs >> Reverse a String using Stack  Hey there, welcome back to another post. In this post, we will learn how to reverse a string using a stack in Java. Java Program to Reverse a String using Stack As we know,  Stack data structure follows last in the first out (LIFO), so by using stack we can reverse a given string. For example:  Input: hello output: olleh After storing into stack Stack -> o l l e h Now print stack -> olleh Java Program:  import java.util.Scanner; import java.util.Stack; /** * https://www.thecodingshala.com/ */ public class Main { public static String doReverse(String str) { Stack<Character> stack = new Stack<>(); // push all characters into stack for ( int i = 0; i < str.length(); i++) { stack.push(str.charAt(i)); } // pop characters from stack and build s...
Read more

Time Complexity, Space Complexity, Asymptotic Notations - The Coding Shala

Image
Home >> Algorithms >> Time and space complexity Time Complexity, Space Complexity, and Asymptotic Notations Time complexity describes the time taken by an algorithm and space complexity describes the memory used by an algorithm. Asymptotic Notations are languages that allow us to calculate time complexity and space complexity. Big O is most commonly used for time complexity or analysis of algorithms. Time Complexity In Computer Science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the length of the string representing the input. The time complexity of an algorithm is commonly expressed using big O notation, which excludes coefficients and lowers order terms.[From Wikipedia] In a simple way we can say how much time our code takes to execute.  So, How to calculate the running time of an algorithm? We can have three cases to analyze an algorithm: Worst Case Average Case Best C...
Read more