# What is the most efficient algorithm for language translation?

# Is Q-Basic an efficient language for most programming?

Answer .
No. Q-Basic is no longer supported by it's creator and therefore should not be used..
Answer .
\nQbasic was designed to work with the old MS-DOS or similar operating systems. Programs written in Qbasic can't take advantage of the resources available in modern operating systems. I wo…uld recommend using something like Visual Basic, VB.Net, C++, Java or one of several programming languages available today. (MORE)

# Where can you find a free online translator that can translate English into most European languages?

First opinion Try worldlingo on the link below ! It has most European languages plus Arabic, Chinese and Japanese. Second opinion I recommend you try Google Language tools. You can find the link on the homepage, on to the right of the page. It can translate entire pages (by entering the URL) …and it can translate some Asian languages, too, like Korean. Third opinion There are draw backs with online translations ! They are done purely word by word, very often the context is wrong or the wrong meaning for words are used ! Don't put to much faith in the results, you could be very disappointed. Bing translator is by far the best and does most languages in my experience it has better results than yahoo and google. (MORE)

# What is the most efficient animal?

I would argue that the Albatross is one of the most efficient animals. It does not have to flap it's wings when it soars across the oceans since it's wing bones lock into place. It is also able to sleep while flying. It has a glide efficiency of 20 feet forward for every 1 foot down.

# Which are the most fuel efficient cars?

The most efficient SUV is the mercury Seattle at 56 MPG :) ---- Volkswagen makes an L3 Lupo that advertises 78 MPG. Hydrogen-powered cars such as the Honda FCX Clarity and the H2 Mazda Rx8 dont even use petrol.

# What is the worlds most efficient airplane?

just a guess = human powered aircraft like the gossamer condor or the one that flew around the world nonstop cant remember the name

# What is the most fuel efficient speed?

I have found that for my Scion Tc the most efficient speed is 57 - 61 mpg. If I speed up slowly, slow down by coasting, and set my cruise control on while driving on the highway I can get well over the estimated 30 mpg..
Like most things fuel efficiency depends on the vehicle. But somewhere between… 55 and 65 should be right. Test it out for yourself during your daily commute and see. There are also some really good articles written about something called Hypermiling. I do not consider myself one of them but I do use a few of there techniques (the ones mentioned above) in order to be more cost and fuel efficient. (MORE)

# What is the most efficient window for a home?

any of the newer windows that are double-pane filled with argon are very efficient. there are many styles and prices

# What language is the most popular for translators?

English is the most popular language for translators followed bySpanish and Chinese according to most online translation services.

# What book other than the Bible has been translated into the most languages?

cats and dogs by Sara Marshall The Book of Mormon, translated fully into 85 languages and portions of the book have been translated into an additional 25 languages.

# In which language are translators needed the most?

I don't work in HR, but... For private sector work, if you live/want to work in the Southwestern US, California, or a major city, I would say Spanish , followed by Chinese. For government or military work, it is definitely led by the languages of the Middle East and Africa . Arabic , Swahil…i, and Russian. This is followed by Asian languages..
Being a native speaker of a second language is a huge plus. The ideal is being 'compound bilingual', or having the ability to speak and read both English and a second language interchangeably with a perfect accent and grammar. These languages need to be spoken fluently. You will be tested in them depending on spoken or written translation, and on what level you will perform. A personal translator will need to be a fluent speaker with excellent pronunciation, knowledge of slang and dialects, and cultural cues. If it is written translation, grammar and spelling will be key. Any field will have a specialized vocabulary in addition to the basic communications, and you will need to have knowledge of this or acquire it. Most languages can be broken into two loose groups: spoken/street/common, and written/formal. (MORE)

# Is an algorithm language dependent?

Algorithms are language independent. An algorithm is a procedure orformula for solving a problem: a finite series of computation stepsto produce a result. Algorithms make no assumptions aboutprogramming languages or technologies; they are generally writtenin plain English. Pseudocode is typically us…ed to demonstrate theimplementation of an algorithm using a combination of plain Englishand program-like constructs such as loops and variables.Programmers can easily convert the pseudocode to a specificprogramming language. (MORE)

# Which programming language is most efficient?

\nmachine language but it is very cumbersome to program in as it is very low level.

# Write a program in C language to implement the apriori algorithm?

JavaScript is one program that has been written in C to implementthe Apriori algorithm. There are also several other known programsavailable on the Internet that implement it as well.

# Heap sort algorithm in C language?

Theory of Algorithms 15-01-2004 Heapsort - Sebastian Streich, Enric Meinhardt 8 Subroutines for Heaps Heapify(A,i) l := largest node of i and its children if ( i Ã¢Â‰Â l ) exchange A[i] with A[l] Heapify(A, l) A real implementation should not be recursive! (overhead when passing the function's argu…ments) (MORE)

# Which algorithm is more efficient- insertion sort algorithm or merge sort algorithm?

On average merge sort is more efficient however insertion sort could potentially be faster. As a result it depends how close to reverse order the data is. If it is likely to be mostly sorted, insertion sort is faster, if not, merge sort is faster.

# How can we write a Algorithm using switch case in C language?

You would write an algorithm using the switch statement in C in the same manner as one would write an algorithm using any other statement. The tools supported by a particular programming language, such as conditional expressions and iteration constructs, are normally used together to implement an al…gorithm. However, one particular group of algorithms lends itself to the use of the switch statement as the primary construct in the algorithm's implementation, although all other language constructs will generally be used in the same implementation: state machines are a method of solving a certain group of problems through a series of states and conditional transitions from one state into another. A simple state machine could, for example, use a switch clause as its primary construct, where each case clause represents one of the possible states. In each state, the condition is checked which might enable the transition to another state. When that condition evaluates to true, the transitional action is taken and the new state is assumed. In its simplest form, a state machine is formed from an endless loop surrounding a switch statement. (MORE)

# Line drawing algorithm in c language?

dda algorithm, bresenham's algorithm, midpoint algorithm.. These are the few that are useful in my opinion.

# Algorithm what language it is?

Algorithms use the language of mathematics, logic and computers. They are independent of any particular natural language like English or Chinese.

# How do you represent an algorithm using natural language?

An algorithm is simply a set of steps required to solve a specific problem. So to represent an algorithm using natural language, just write down the required steps.

# Source code of apriori algorithm in c language?

If you would like a Java implementation, then you could have a look at this website (see related links, below). It offers an open-source java implementation of APriori.

# What programming language to be used in algorithm?

Algorithms can be described in any programming or natural language, or with special devices like flow-charts.

# Is an algorithm a programming language?

No, an algorithm is not a programming language, and it is not language specific. It is a statement of the methodology used to perform some process, solve some problem, etc.

# Translating an algorithm into a programming language is called?

Translating an algorithm into a programming language is calledcoding. A variable declaration tells the operating system toallocate storage space in RAM.

# What is language translation in programming language?

I think what you are looking for is an English like translation of the programming logic. If this is what you are looking for, then the language translation of a programming language is called Pseudocode. Pseudocode is the practice of breaking down programming logic into English like meanings. Howev…er, pseudocode is usually written' before any programming takes place, because this allows us to get an idea of what we are trying to accomplish. When I took my fundamentals of programming design and logic in college, the whole class was focused on just pseudocode and flowcharts. I hope this answers your question. (MORE)

# Why recursive algorithms are difficult to implement in programming language?

Recursive algorithms work in an opposite direction as compared to normal algorithms or loops. First the recursion occurs then it back tracks, both of these steps combine to give what a loop does in one single step. But values may change in both the steps, thus complicating the algorithm. For eg: … int fact(int n) for(i=1;i (MORE)

# Algorithm for reflection and translation for triangle in computer graphics?

//reflection for triangle # include # include # include # include char IncFlag; int PolygonPoints[3][2] = {{10,100},{110,100},{110,200}}; void PolyLine() { int iCnt; cleardevice(); line(0,240,640,240); line(320,0,320,480); for (iCnt=0; iCnt

# Chris in Italian is Chris because most languages don't translate names?

No, because he is an American and they use the name he is known by in his home country, at least for celebrities. For example: Giorgio Armani is NOT known as George Armani in the English speaking world. Pierre Cardin was never known as Petre Cardin in the English speaking world. That is not to say t…he names do not have equivalents in other languages. There is an Italian name Cristoforo, which is Italian for Christopher. (MORE)

# Randomized quicksort algorithm in c language?

Instead of choosing the last element of every sub array as the pivot, we choose a random element in Randomized version and swap it with the last element before partitioning.

# Implement Bresenham algorithm using c language?

include#include#include#includevoid draw_line(float,float,float,float);main(){int driver,mode;float x1,y1,x2,y2;clrscr();printf("Enter the two endpoints of the line:");printf("\nx1 =");scanf("%f",&x1);printf("y1 =");scanf("%f",&y1);printf("x2 =");scanf("%f",&x2);printf("y2 =");scanf("%f",&y2);clrscr…();driver = DETECT;initgraph(&driver,&mode,"\\tc\\bgi"); \\path of bgi can be different in your casedraw_line(x1,y1,x2,y2);getch();closegraph();}void draw_line(float x1,float y1,float x2,float y2){float dy,dx;float x,y;float p,p0,dp1,dp2;dy = y2-y1;dx = x2-x1;p0 = 2 * (dy - dx);dp1 = 2 * dy;dp2 = 2 * (dy - dx);putpixel(x1,y1,EGA_WHITE);p = p0;for(x=x1+1,y=y1;x (MORE)

# How are language syntax and algorithms alike?

Language syntax and algorithms are not alike. These are two different things. Syntax is the specification of how a particular step is described to the compiler, while an algorithm is a syntax independent way of describing the process used to solve a problem.

# Which is most efficient data structure?

Arrays are the most efficient data structure. Memory is allocatedto the entire array as a single operation and the total memoryconsumed is equal to the product of the element size and the numberof elements (all elements being of equal size, in bytes). Thismeans that any element in the array can be a…ccessed using simplepointer arithmetic from the start of the array, with the firstelement at offset 0. All high level languages hide the pointerarithmetic behind an array suffix operator, such that element [5]will be found 5 * sizeof (element) bytes from the start address ofthe array (the address where element [0] resides).Multi-dimensional arrays are implemented as an array of arrays,such that a two-dimensional array is a one-dimensional array whereevery element is itself a one-dimensional array. These can bethought of as being a table of rows and columns where the firstdimension access a one-dimensional row array, and the seconddimension accesses the column within that row. A three-dimensionalarray can then be thought of as being an array of tables or acuboid (a stack of tables). A four-dimensional array can thereforebe thought of as being an array of cuboids, a table of tables, or acuboid of arrays. By imagining arrays in this manner it becomesmuch simpler to imagine arrays with more than 3 dimensions. By contrast, a list or a tree structure is less efficient becauseevery element requires at least one additional field to maintainthe link from that element to another element, thus defining thestructure. You also need to maintain an additional field to referto the first element in the structure. If you have a structure thatcan dramatically vary in size, lists may be more efficient becausethere is no need to reallocate the entire structure; you simplyallocate and deallocate memory for individual elements and updatethe links between elements to maintain the structure. However, youlose constant-time random access because you have to traverse thelinks in the structure to locate an individual element and theadditional level of indirection means it will be slower than anarray. However, reallocating an array often means copying the arrayto new memory. One way to minimise reallocations is to reserve morememory than you actually need, thus allowing you to add newelements more quickly at the cost of some memory. You only need toreallocate when you run out of reserve. You can also minimise thecost of reallocation by storing pointers rather than objects inyour array. This adds an extra level of indirection, but speeds upthe reallocation process by only copying pointers rather thanobjects being pointed. (MORE)

# When are solar cells most efficient?

"Solar cells are the most efficient when they are facing the sun at a certain angle of 90 degrees."

# What do you mean by the efficiency of an algorithm?

Ã¢Â€Â¢ a measure of the amount of resources consumed in solving a problem of size n.
-time.
-space.
Ã¢Â€Â¢Benchmarking: implement algorithm,.
-run with some specific input and measure time taken.
-better for comparing performance of processors than for comparing performance of algorithms.
Ã¢Â…€Â¢Big Oh (asymptotic analysis).
-associates n, the problem size,.
-with t, the processing time required to solve the problem. (MORE)

# What is the most energy efficient color?

White and pale green . Pastel colors tend to have more solar reflecting ability due to the amount of cloraplitic content. Because of this material, most people have white roofs if looking for a way to balance energy. I mean, who hasn't heard of the absorbing black and the reflecting white. Lighter c…olors keep heat energy away. (MORE)

# How is the efficiency of a sorting algorithm determined?

A sorting algorithm's efficiency is measured in the number of comparisons required to completely sort the elements in the array given a worse case scenario. The best sorting algorithms are rated at O(n), where n is the number of elements, and the worst algorithms are O(n 2 ), with most algorithms fa…lling in the O(n log n) range. A best case algorithm, for example, takes about 20 comparisons when there are 20 elements, while a worst case algorithm would take about 400 comparisons for 20 elements. (MORE)

# What is the most efficient retirement calculator?

There are many different retirement calculators you can use however only a few are top rated. The two main companies are USAA, and Ameriprise these are both efficient and reputable.

# Which electric heater is the most efficient?

I hope to save people a lot of money by answering this. $10.00 electric heater or $500.00 electric heater THERE IS NO DIFFERENCE IN EFFICIENCY. The $500.00 heater might be better build quality, safety features such as tip over protection, and or, over heat protection, and or, double cased to l…et cats sit on it and children not get burned from touching it, but I bet if you look up the statistics on any electric heater you will find a 120 volt, 1500 watt heater will produce 5118 btu. the only way to save money using them is to put them in the room you frequent most and turn your whole house thermostat down. please do not purchase a $ 10.00 safety feature starved electric heater if you need to use it in a situation that could benefit from having them. (MORE)

# What are the most efficient application servers?

"According to consumer voting, the best premium application server is IBM WebSphere. The most efficient open source application server is Apache Geronimo."

# Who invented the synthesizer algorithms programming language?

SNAP Syn thesizer A lgorithms P rogramming SNAP, which is an acronym for synthesizer algorithms programming, is a vendor-neutral programming language developed specifically for programming synthesizers of all examples from all eras that will teach the programmers the funda…mental techniques in analog & digital sound manipulation and sound design in order to achieve a desired sonic goal. SNAP was invented and given its name, description and an accompanying SNAP programming user's guide during the summer of 2008 by prolific inventor Andre Gray, the inventor of ringtones, and the electronic press kit among many other digital media inventions. (MORE)

# What size cells are the most efficient?

Those with a larger surface area and less volume. The less volume the faster and more efficient transport is which allows the cell to prosess and respond to its environmental changes repidly and reach homeostasis.

# What is pseudocode in c language how is it different from algorithm?

Neither of them is part of C language. Algorithm is a method to solve a problem; pseudo-code is a way to (kind of) formalize the algorithm, actually it is a mix of plain text and some (fictional) programming language.

# What are the disadvantages of algorithms in c language?

An algorithm simply describes the finite, procedural steps requiredto solve a problem. Algorithms are not specific to any oneprogramming language, but without algorithms there would be nocomputer programs let alone programming languages. That is, youcannot program a computer to solve a problem unles…s you know how tosolve the problem yourself and for that you need to know thealgorithm. Once you have the algorithm, you can program thecomputer to implement it. (MORE)

# What languages can be translated by Google Translator?

There are sixty five languages that currently are able to be translated by Google Translator. These languages are Afrikaans, Albanian, Arabic, Belarusian, Bulgarian, Catalan, Chinese (simplified), Chinese (traditional), Croatian, Czech, Danish, Dutch, English, Estonian,Esperanto, Filipino, Finnish,… French, Galician, German, Greek, Hebrew, Hindi, Hungarian, Icelandic, Indonesian, Irish, Italian, Japanese, Korean, Latvian, Lithuanian, Macedonian, Malay, Maltese, Norwegian, Persian, Polish, Portuguese, Romanian, Russian, Serbian, Slovak,Slovenian, Spanish, Swahili, Swedish,Thai, Turkish,Ukrainian, Vietnamese, Welsh, and Yiddish. They also have Armenian, Azerbaijani, Basque, Georgian, Gujarati, Haitian Creole, Kannada, Latin, Lao, Tamil, Telugu, and Urdu, but they are not as accurate. (MORE)

# What is the most efficient geometrical shape?

We cannot assess the efficiency of a geometrical shape unless we have a particular purpose in mind. You will have to state what you wish to efficiently do, by means of a geometrical figure.

# Which is the most efficient storage class?

Storage classes are not intended for efficiency, they are storage duration specifiers intended to define or refine thescope, visibility and lifetime of a variable.

# What is the most expensive Franklin Language Translator Computer?

The most expensive Franklin Language Translator Computer will vary in price depending on where one is purchasing them from. In the United States the most expensive one's are around $200 and the cheapest about $15.

# Why is assembly language efficient?

Assembly language is efficient because it is at a low-level ofabstraction. Because of this, the programmer is in more control ofthe computer's processor than if he/she were to program in a highlevel language, meaning that the program made executes faster.

# Is an algorithm close to a programming language?

Fairly close. A programming language is a means of communicating with the machine, instructing it to perform a specific sequence of statements. Depending on the language, those statements may be low-level (like assembly) or high-level (like Java). The level determines the amount of abstraction betwe…en the language and the machine. Higher-level languages are easier to program than low-level languages, but low-level languages are generally more efficient. An algorithm is a procedure or formula for solving a problem; a finite series of computation steps to produce a result. A programming language is not an algorithm. It simply provides the means of translating an algorithm into machine-dependant instructions. Algorithms are typically written using pseudo-code, a non-existent, generalised programming language that can be easily translated into a more specific programming language. Many programming languages incorporate algorithms as part of the language. For instance, the C++ standard template library provides many algorithms in the form of function templates that can accommodate a wide variety of sequence containers (class templates), such as arrays, lists, sets and maps, or any user-defined container that follows the standard. For example, the std::sort algorithm is a function template that can be used to sort a sequence container, regardless of it type and regardless of the type of data it contains. Although these algorithms are generic in nature, they are highly optimised such that they do not sacrifice performance for generality. You don't have to use them -- you can easily write your own algorithms to perform the same tasks -- but it makes no sense to re-invent wheels unnecessarily, especially for an "everyday" algorithm like sorting or accumulation. Programs are themselves an algorithm, albeit a highly-complex one composed of many individual algorithms. Thus we can think of a programming language as being the means of implementing simple algorithms in order to solve complex problems. (MORE)

# Why does algorithm efficiency matter when the number of inputs becomes large?

The complexity of an algorithm can be expressed in terms of theamount of memory consumed and time taken relative to the number ofinputs. In other words, the algorithm's time and space complexitiescan both be expressed as a function of n, the number of inputs. Typically, we express algorithm complex…ities using Big-Omeganotation, also known as Big-O, where O(1) denotes constant-time orconstant-space, depending on which is being measured. Constant-time algorithms that operate upon data sequences of nelements are not impossible. For example, the algorithm whichreturns the first element of a sequence of n elements can beachieved in constant-time if we also have constant-time access tothe first element of the sequence (which is generally the case forthe majority of data sequence containers). More commonly, an algorithm operating upon a data sequence needs toperform one or more passes over that sequence, either in whole orin part. As such, a single pass over a sequence of n inputs wouldtake O(n) time, also known as linear time. The algorithm to search an unsorted sequence for a given value hasa best case of O(1) and a worst case of O(n). The best case occurswhen the first element happens to be the value we're looking for,while the worst case occurs when it is the last element or thevalue does not exist. If the value does exist, the average case isO(n/2), because there's a 50/50 chance the value will be somewherein the first half of the sequence. All sorting algorithms have a worst case of O(n*n). That is, 1complete pass of the sequence places 1 element in its correctplace, thus we must make n passes to place all n elements in theircorrect place. O(n*n) is known as quadratic time. For shortsequences, O(n*n) is a perfectly acceptable time-complexity but fora larger sequence it is not. This is because a sequence of 10elements would take just 100 units of time, but a sequence of 100elements would take 10,000 units of time on the same machine. Inother words, it would take 100 times longer to sort a sequence thatis just 10 times larger. Similarly, a sequence of 1000 elements(100 times larger) would take 1,000,000 units of time (10,000 timeslonger). As n increases, the time taken to sort n elements inevitablyincreases, however we can slow down the increase in time relativeto an increase in n by using a more efficient algorithm. Thequicksort algorithm has an average case of O(n log n), where log nis the binary logarithm of n. This is known logarithmic time.Quicksort is ideal for sorting large sequences because timeincreases more slowly, to the extent we can effectively double thenumber of elements before we see any significant change in the timetaken. Quicksort works be selecting a pivot value from the unsorted set,and dividing the set into two parts around the pivot, such that allvalues in the first part are less than the pivot while valuesgreater than or equal to the pivot are placed in the second part.The pivot is placed between the two parts and is therefore in itscorrect place. We then repeat the process with each of the twoparts. When a part has just zero or one elements, it is completelysorted. When all parts are sorted, the whole set is sorted. Clearly, pivot selection is fundamental to the algorithm'sefficiency. Ideally, we want to select the median of all elements(the middle value) such that the two partitions are of equal size(differing by no more than 1 element). However, the time-complexityof calculating the median of an unsorted set is O(n), and that'sfar too much overhead. Instead, we select the median of the first,last and middle elements (median-of-three) because this can beachieved in constant-time (depending on the container type, hencequicksort is ideally suited to arrays). Quicksort can be improved further with a three-way partition, whereall elements in the middle partition are equal to the pivot valueand therefore don't need to be sorted (they are already in thecorrect place relative to the other two partitions). The addedcomplexity of creating the third partition is offset by the factthe third partition will reduce in size more quickly than itotherwise would. Of course, complexity is merely an indication of performance. Twosorting algorithms with exactly the same complexity may performvery differently indeed. The type of the sequence container canoften be a major factor too. For example, arrays will generallyoutperform lists because lists do not have constant-time randomaccess. Arrays also consume less memory than lists. However, a liststored in main memory will typically outperform an array stored ina disk file. Complexity does not take these factors into account.Moreover, time-complexity is not an expression of time takenbecause the actual runtime performance depends on the hardware.However, while a single "unit of time" is not defined; thetime-complexity tells us roughly how many units of time we canexpect to be consumed by the algorithm. All else being equal, thatnumber should be the same regardless of the hardware. As well as time complexity, we also have to consider the spacecomplexity as we often have to sacrifice one for the other. Spacecomplexity relates to memory consumption and is usually of moreimportance when working with memory-limited hardware. However,space-complexity does not include the space occupied by the inputs,but rather the amount of additional space required by the algorithmrelative to the number of inputs. For example, quicksort has aspace complexity of O(log n) due to its recursive nature, with aworst case of O(n). By contrast, insertion sort (which isnon-recursive) has a space-complexity of O(1); the amount ofadditional memory is the same regardless of the number of inputsbut it has a time-complexity of O(n*n). As such, it is ideallysuited to smaller sets. With sorting algorithms we must also consider stability. A stablesort places equal elements in the same order they were input, whilean unstable sort does not guarantee this. Stability is importantwhen working with elements that can be sorted by more than onefield (secondary fields). For example, when sorting files by nameand then subsequently sorting by type, we expect those of the sametype to remain in name order because that was the order of input.With a stable sort, we don't have to keep track of secondary keysbut with an unstable sort we do. Although unstable sortingalgorithms are generally quicker than stable ones, if stability isrequired we must sacrifice at least some performance to maintainstability. (MORE)

# How do you implement Dijkstra's algorithm in c language?

/* Dijkstra's Algorithm in C */ /* Source: w w w . c o d e w i t h c . c o m / d i j k s t r a s -a l g o r i t h m - i n - c #include #include #include #include #include #define IN 99 #define N 6 int dijkstra(int cost[][N], int source, int target); int main() { int cost[N][N],i,j,w,ch,co; int sourc…e, target,x,y; printf("\t The Shortest Path Algorithm ( DIJKSTRA'S ALGORITHM in C\n\n"); for(i=1;i< N;i++) for(j=1;j< N;j++) cost[i][j] = IN; for(x=1;x< N;x++) { for(y=x+1;y< N;y++) { printf("Enter the weight of the path between nodes %d and %d:",x,y); scanf("%d",&w); cost [x][y] = cost[y][x] = w; } printf("\n"); } printf("\nEnter the source:"); scanf("%d", &source); printf("\nEnter the target"); scanf("%d", &target); co = dijsktra(cost,source,target); printf("\nThe Shortest Path: %d",co); } int dijsktra(int cost[][N],int source,int target) { int dist[N],prev[N],selected[N]={0},i,m,min,start,d,j; char path[N]; for(i=1;i< N;i++) { dist[i] = IN; prev[i] = -1; } start = source; selected[start]=1; dist[start] = 0; while(selected[target] 0) { min = IN; m = 0; for(i=1;i< N;i++) { d = dist[start] +cost[start][i]; if(d< dist[i]&&selected[i]0) { dist[i] = d; prev[i] = start; } if(min>dist[i] && selected[i]==0) { min = dist[i]; m = i; } } start = m; selected[start] = 1; } start = target; j = 0; while(start != -1) { path[j++] = start+65; start = prev[start]; } path[j]='\0'; strrev(path); printf("%s", path); return dist[target]; } (MORE)