Skip to main content

Basic Structure of a C++ program | C++ tutorial

Today we will see how we will write C++ programs. and try to understand some basic concept of C++ in detail. so let's write a program in C++. and then we will understand the meaning of each and every line of our program.

Our first C++ program:

#include<iostream>
using namespace std;

int main(){

cout<<"hello C++"<<endl;

}

so let's understand the structure of our program.
the very first line is :
#include<iostream>
so basically what it is?
#include is a preprocessor directive that tells it to paste in the contents of the header file into the stream of C++ code that is fed to the compiler.

iostream stands for standard input output stream. this is basically a header file, inside this file there are different kind of functions and classes, which we use in our programs. this header file makes us able to send and receive data.

second line is:
using namespace std;
this line declares that classes and functions of the standard library can be used directly in the code. if you don't write this line then  the structure of code will get change and now you have to write the same program like this:
#include<iostream>
int main(){
std:cout<<"hello C++"<<endl;
}

third line is:
int main()
it is a function named "main". we will learn about function later. till now just understand that every program must have a main() function.

int main() means there is function named "main", whose return type is "int". we will see all these things in detail. so don't be panic.

next line is:
cout<<"hello C++"<<endl;

this line will print hello C++ on the screen after executing the code. so to print any thing on screen we will use cout<<thing which we want to print<<endl;

endl means end of line.

basically cout is an object(we will learn about object later). which is used for send output to the screen.

Output:



Comments

Popular posts from this blog

Disjiont Set Union-Find Data Structure | Code In C++

 Introduction:  In this tutorial we are going to write full program of disjoint set union find advance data structure in c++.  Problem Description: Disjoint Set Union (DSU) is an advance data structure, which basically uses in graph algorithms to find cycles. Codes:  Method1: Brute Force #include<bits/stdc++.h> using namespace std; int find(int f,vector<int>&dsuf){     if(dsuf[f]==-1)         return f;     return find(dsuf[f],dsuf); } void union_op(int from, int to, vector<int>& dsuf){     dsuf[from]=to; } bool isCycle(vector<pair<int,int> >&edge_list, vector<int>&dsuf){     for(int i=0;i<edge_list.size();i++){         int parent1=find(edge_list[i].first,dsuf);         int parent2=find(edge_list[i].second,dsuf);         if(parent1==pare...

Construct Binary Tree from preorder and inorder | Data Structure

Introduction: In this tutorial we are going to see how we can construct the binary tree from given preorder and inorder. Prerequisites: you should know about binary tree traversal and on paper you can draw binary tree from given preorder and inorder traversal. Inorder:left->root->right; Preorder:root->left->right; Problem Statement: we have given two arrays. one for preorder and another for inorder. by using these two array we have to built a binary tree. eg: preorder = [3,9,20,15,7] inorder = [9,3,15,20,7] solution: Solution: We will follow recursive approach to solve this question.let's discuss how we can solve it. Trick: In the given preorder the very first element will be the root of the tree. then we will find root element in inorder also. and we know in inorder traversal we have left part then root and then right part of the tree. by using preorder we can get the root of the main tree and by using inorder and root we can get the left part and right part of the...

Symmetric Tree | Interview Problem

Introduction: In this tutorial we are going to solve a good question which will clear your doubts on how BFS or level order traversal is useful to solve binary tree problems. this is basically a question from Leetcode, and it is really very good problem to practice BFS. Problem Statement: Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmetric: But the following [1,2,2,null,3,null,3] is not: Link : Leetcode Link please make binary tree on paper by the given array above. and you will get a clear picture of the problem. what we are going to do in this problem. Solution: As we know we are going to apply BFS to solve this problem. actually you have to just get one thing to solve this problem. we will perform BFS, but with little change or modification. So first we will store the root->val in a vector or array of the left subtree. and during this we will first insert left child and then ...