Search Results

Search found 7490 results on 300 pages for 'algorithm analysis'.

Page 66/300 | < Previous Page | 62 63 64 65 66 67 68 69 70 71 72 73  | Next Page >

• Sorting an array with two values

  - by davit-datuashvili

  I have array of colors: String s[]=new String[]{"red","black..............}; The only possible colors are red and black. I need an algorithm which partitions the array such that all red come before all black. How can I compare/exchange them to accomplish that?

  Read the article

• Need algorithm to add Node in binary tree

  - by m.qayyum

  •if your new element is less or equal than the current node, you go to the left subtree, otherwise to the right subtree and continue traversing •if you arrived at a node, where you can not go any deeper, because there is no subtree, this is the place to insert your new element (5)Root (3)-------^--------(7) (2)---^----(5) ^-----(8) (5)--^ i want to add this last node with data 5...but i can't figure it out...I need a algorithm to do that or in java language

  Read the article

• i need your advise please help

  - by davit-datuashvili

  for example we have array of color String s[]=new String[]{"red","black..............}; all color is red or black i need algorithm which partition array such that all red came before to black so how compare it and exchange to accomplish this task ,

  Read the article

• Finding max clique in perfect graphs

  - by copperhead

  A fast algorithm to find the size of the largest clique in a perfect graph(this one having odd cycles with at least 1 chord) with about 100 vertices ??

  Read the article

• What is the best approximation in salesman problem?

  - by Svisstack

  Hello, I want to know what algorithm do best approximation on salesman problem, and in what scale this approximation like to be a optimal solve (%?) Anyone can help me on this?

  Read the article

• Dijkstra's Algorithm explanation java

  - by alchemey89

  Hi, I have found an implementation for dijkstras algorithm on the internet and was wondering if someone could help me understand how the code works. Many thanks private int nr_points=0; private int[][]Cost; private int []mask; private void dijkstraTSP() { if(nr_points==0)return; //algorithm=new String("Dijkstra"); nod1=new Vector(); nod2=new Vector(); weight=new Vector(); mask=new int[nr_points]; //initialise mask with zeros (mask[x]=1 means the vertex is marked as used) for(int i=0;i<nr_points;i++)mask[i]=0; //Dijkstra: int []dd=new int[nr_points]; int []pre=new int[nr_points]; int []path=new int[nr_points+1]; int init_vert=0,pos_in_path=0,new_vert=0; //initialise the vectors for(int i=0;i<nr_points;i++) { dd[i]=Cost[init_vert][i]; pre[i]=init_vert; path[i]=-1; } pre[init_vert]=0; path[0]=init_vert; pos_in_path++; mask[init_vert]=1; for(int k=0;k<nr_points-1;k++) { //find min. cost in dd for(int j=0;j<nr_points;j++) if(dd[j]!=0 && mask[j]==0){new_vert=j; break;} for(int j=0;j<nr_points;j++) if(dd[j]<dd[new_vert] && mask[j]==0 && dd[j]!=0)new_vert=j; mask[new_vert]=1; path[pos_in_path]=new_vert; pos_in_path++; for(int j=0;j<nr_points;j++) { if(mask[j]==0) { if(dd[j]>dd[new_vert]+Cost[new_vert][j]) { dd[j]=dd[new_vert]+Cost[new_vert][j]; } } } } //Close the cycle path[nr_points]=init_vert; //Save the solution in 3 vectors (for graphical purposes) for(int i=0;i<nr_points;i++) { nod1.addElement(path[i]); nod2.addElement(path[i+1]); weight.addElement(Cost[path[i]][path[i+1]]); } }

  Read the article

• Object Pooling managment algorithm.

  - by Talha Bin Shakir

  Hi, Anyone can help me to write an algorithm for object pooling. I am very new in J2EE and i need object pooling for database connection. So please help out. Thanks

  Read the article

• What are the real-world applications of huffman coding?

  - by jcyang

  I am told that Huffman coding is used as loseless data compression algorithm but also am told that real data compress software do not employ huffman coding,cause if the keys are not distributed decentralized enough,the compressed file could be even larger than the orignal file. This leave me wondering are there any real-world application of huffman coding? thanks.

  Read the article

• graph algorithms

  - by davit-datuashvili

  now one ask please help me to write a few graph algorithms for example http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm there is given such graph my problem is that i want implement graph algorithms on arrays can anybody help me to imlement ddijkstra algorithm on array i want to see one example because it is difficulty for me to understand this pseudocodes which is in internet i mean classes edges and so on please help me

  Read the article

• Fastest method implementing number multiplication in strings (1000000 digits)

  - by Svisstack

  Hello, I want to write fastest possible algorithm for 2 number multiplications. Each number has max digits around 1000000 and is contained in string. Anyone want to tell about this problem? I searching really speed solution.

  Read the article

• Fastest method implementing number sqare root in string (1000000 digits)

  - by Svisstack

  Hello, What is fastest algorithm implementing a square root of decimal contained in strings. This decimal can have 1000000 digits. Anyone can tell me something about it?

  Read the article

• Balancing a Binary Tree (AVL)

  - by Gustavo Carreno

  Ok, this is another one in the theory realm for the CS guys around. In the 90's I did fairly well in implementing BST's. The only thing I could bever get my head around was the intricacy of the algorithm to balance a Binary Tree (AVL). Can you guys help me on this?

  Read the article

• Is there a bruteforce-proof hashing algorithm?

  - by Col. Shrapnel

  Well, from the discussion of hashing methods weaknesses, I've got that the only ol' good brute-force is efficient to break. So, the question is: Is there a hashing algorithm which is more steady against brute-force than others?

  Read the article

• Is there a way to figure out the true bit rate of an audio file?

  - by The Rook

  Lets say you have a 96 kbit mp3 and you Transcode the file into a 320 kbit mp3. How could you programmatically detect the original bit rate? Does one exist or how should I approach this problem? Perhaps an algorithm to detect Generation Loss could be used.

  Read the article

• How to calculate a measure of a total error in this clustering

  - by Vafello

  I have the following points and clustering of data S1. Can anyone tell me how to calculate the total error associated with this clustering? I know it's not a strictly programming question, but I need it for my algorithm. I think the answer should be 4/3 but I have no idea how to calculate this. Can anyone help me? x1= (2.0,1.0) x2= (2.0,2.0) x3= (1.0,2.0) S1={ x1, x2, x3 }

  Read the article

• How to Create Own HashMap in Java?

  - by Taranfx

  I know about hashing algorithm and hashCode() to convert "key" into an equivalent integer (using some mathematically random expression) that is then compressed and stored into buckets. But can someone point me to an implementation or at least data structure that should be used as baseline? I haven't found it anywhere on the web.

  Read the article

• effective functional sort

  - by sreservoir

  I'm programming a function for a TI-NSpire, so I can't use the builtins from inside a function. What is the most generally efficient algorithm for sorting a list of numbers without modifying the list itself? (recursion and list-splitting are fair game, as is general use of math.)

  Read the article

• Stopping Backtracking

  - by John Retallack

  Is there any way in C/C++ to stop a backtracking algorithm after finding the first solution without exiting the program. I want my function to immediately exit the function,not to quit every level of recurrsion one by one stating return.

  Read the article

• recursive add binary numbers

  - by davit-datuashvili

  i need following algorithm let say we have 5 //101 and 7 //111 numbers are arbitrary i need to add these numbers using the recursive method and at the same time using bitwise methods such that result should be 101 + 111 110 0 or 12 can anybody help me?

  Read the article

• What encryption algorithm is best for small strings ?

  - by Lee Shtoy

  Hey, I have a string of 10-15 characters and I want to encrypt that string. The problem is - I want to get a shortest encrypted string as possible. I will also want to decrypt that string back to its original string. Which encryption algorithm fits best to this situation ? Thanks

  Read the article

• How to count the number of right children in a binary tree?

  - by flopex

  How to count the number of right children in a binary tree? This means that I only want the children marked as right. Ex. (Left | Right) F(Root) G | H T U | I J The right children would be U,H,and J. What would be the algorithm to find these.

  Read the article

• Matching between product and customer personal information

  - by Yanshof

  I writing some application that find ( according to some question ) information about some person ( lets say that the information are weight, hight and age of the person ). In the other hand i have product list ( can be very big one ) and according to the product information i need to find the best matching between the person information and the product ( the product information that i have are water part, nitrogen part and ext. ) I can't use flow chart algorithm or Breadth-first search because the number of the product is dynamically ( read the product list from DB ... )

  Read the article

• Fastest possible summing numbers up to N

  - by dada

  Okay so i need really FAST algorithm or code in C if you have any it would be nice. The task is to sum all numbers from 1 to N for a given number N (it can be negative number too), so i did the usual way (you know just summing with loop from 1 to N) but it's not fast enough - i need something faster, i guess that i need the fastest possible way to do this. If anyone could help me, please do. Thanks.

  Read the article

• What's the most "exotic" data structure you've used in a .net application

  - by Pierreten

  With the large amount of BCL types such as Dictionary, HashTable, List, all the IEnumerable types; I was curious to know what were some of the more advanced structures you've had to implement and for what algorithm/application.

  Read the article

• What is Chain Matrix Multiplication ?

  - by Hellnar

  Hello, I am trying to understand what is a chain matrix multiplication and how it is different from a regular multiplication. I have checked several sourcers yet all seem to be very academically explained for me to understand. I guess it is a form of dynamic programming algorithm to achieve the operation in an optimised way but I didn't go any further. Thanks

  Read the article

< Previous Page | 62 63 64 65 66 67 68 69 70 71 72 73  | Next Page >