FLOYD’S TRIANGLE USING C



To write a c program to display the Floyd’s triangle using nested for loop. 

/*FLOYD’S TRIANGLE*/
#include<stdio.h>
#include<conio.h>
void main()
{
int n,s=0,i,j;
clrscr();
printf("Enter number of rows:");
scanf("%d",&n);
printf("\n\tFLOYD'S TRIANGLE");
for(i=0;i<=n;i++)
{
for(j=1;j<=i;j++)
{
s=s+1;
printf("\t%d",s);
}
printf("\n\n");
}
getch();
}









OUTPUT:
   Enter number of rows:4

        FLOYD'S TRIANGLE

        1

        2       3

        4       5       6

        7       8       9       10

Comments

  1. UnknownFebruary 10, 2011 at 10:10 PM

    Hi..
    I like this programs and it is very useful for me.

    ReplyDelete

Post a Comment

Popular posts from this blog

Programming Language an Overview

Image
Figure : Programming Language Programming Language an Overview Hi .,                                                                       Welcome to my Blog.                                This blog is very useful to guide for the basic computer user. First we avoid the inferiority complex about computer usage. Computer is very simple machine while you do interest about that. Ok., Now we are discuss about the programming language. Programming Language:    ...
Read more

TRAVELING SALESMAN USING BRANCH AND BOUND TECHNIQUE

Image
The Traveling Salesman Problem (TSP) is a classic problem in computer science and optimization theory. The problem is defined as follows: given a set of cities and the distances between them, find the shortest possible path that visits each city exactly once and returns to the starting city. The Branch and Bound technique is an algorithmic paradigm for solving combinatorial optimization problems. The basic idea is to explore the search space by dividing it into smaller subproblems, and then pruning branches of the search tree that can be shown to lead to suboptimal solutions. The branch and bound algorithm for the TSP works by starting with an initial lower bound on the length of the optimal tour, and then exploring the search space by systematically building up partial tours and computing lower bounds on their completion. Sample C code for solving the Traveling Salesman Problem(TSP) using the branch and bound technique: #include <stdio.h> #include <stdlib.h> #include ...
Read more

Arrays

Image
  Arrays are a fundamental data structure in computer programming that allow you to store a collection of data of the same type in contiguous memory locations. An array is a collection of elements of the same data type, each identified by an index or a subscript. The elements in an array can be accessed by their index value. The first element in an array is typically indexed with 0, and the last element is indexed with n-1, where n is the total number of elements in the array. Arrays can be used to represent a variety of data structures, including lists, stacks, and queues. They are useful for storing large amounts of data that can be accessed and processed quickly. Here's an example of declaring and initializing an array of integers in C: int arr[5] = {1, 2, 3, 4, 5}; In this example, we declare an array of integers called arr with 5 elements. We initialize the array with the values 1, 2, 3, 4, and 5. To access an element in the array, we can use its index value: int x = arr[0...
Read more