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...

Name an advantage of array over linked list?

Answer Posted / santhosh k

Data acess is very faster in arrays

Is This Answer Correct ?    120 Yes 21 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

There are two base class B1,B2 and there is one class D which is derived from both classes, Explain the flow of calling constructors and destructors when an object of derived class is instantiated.

2054


What is oops with example?

1104


What is byval and byref? What are differences between them?

2272


What is polymorphism explain?

1318


What are the two different types of polymorphism?

1197


What is polymorphism used for?

1112


Why is destructor used?

1081


What is oops and its features?

1153


Give an example where we have to specifically use C programming language and C++ programming language cannot be used?

1695


What is polymorphism in oop example?

1074


Can private class be inherited?

1226


Write a program to reverse a string using recursive function?

2415


What is abstraction in oop?

1192


#include #include #include #include void select(char *items, int count); int main(void) { char s[255]; printf("Enter a string:"); gets(s); select(s, strlen(s)); printf("The sorted string is: %s.\n", s); getch(); return 0; } void select(char *items, int count) { register int a, b, c; int exchange; char t; for(a = 0; a < count-1; ++a) { exchange = 0; c = a; t = items[ a ]; for(b = a + 1; b < count; ++b) { if(items[ b ] < t) { c = b; t = items[ b ]; exchange = 1; } } if(exchange) { items[ c ] = items[ a ]; items[ a ] = t; } } } design an algorithm for Selection Sort

2606


What is balance factor?

1132