Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...

inline function is there in c language?

Answer Posted / kathir

No, Inline functions are introduced in C++ to avoid the
problems while using macros.
using inline functions in C++ is as equivalent as defining
a function macro.

Is This Answer Correct ?    4 Yes 0 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

what is the syallabus of computer science students in group- 1?

2368


Explain can you assign a different address to an array tag?

1117


Explain heap and queue.

1139


What are pointers?

1157


how to find anagram without using string functions using only loops in c programming

3231


How can I trap or ignore keyboard interrupts like control-c?

1114


praagnovation

2348


printf(), scanf() these are a) library functions b) userdefined functions c) system functions d) they are not functions

1214


Explain the use of #pragma exit?

1216


In which layer of the network datastructure format change is done

1940


What is a structural principle?

1238


What is #include stdio h and #include conio h?

1173


You have given 2 array. You need to find whether they will create the same BST or not. For example: Array1:10 5 20 15 30 Array2:10 20 15 30 5 Result: True Array1:10 5 20 15 30 Array2:10 15 20 30 5 Result: False One Approach is Pretty Clear by creating BST O(nlogn) then checking two tree for identical O(N) overall O(nlogn) ..we need there exist O(N) Time & O(1) Space also without extra space .Algorithm ?? DevoCoder guest Posted 3 months ago # #define true 1 #define false 0 int check(int a1[],int a2[],int n1,int n2) { int i; //n1 size of array a1[] and n2 size of a2[] if(n1!=n2) return false; //n1 and n2 must be same for(i=0;ia1[i+1]) && (a2[i]>a2[i+1]) ) ) return false; } return true;//assumed that each array doesn't contain duplicate elements in themshelves }

3231


How do I get an accurate error status return from system on ms-dos?

1175


What is difference between array and pointer in c?

1135