Search Results

Search found 5070 results on 203 pages for 'algorithm'.

Page 100/203 | < Previous Page | 96 97 98 99 100 101 102 103 104 105 106 107  | Next Page >

• i have question about job

  - by davit-datuashvili

  hi i will explain my situation i am study algorithms and data structures and i know many thing practical and others most thoereticaly and trying to implement in practise i want to get job where i will study more quickly i am interested if i have chance to start job when i have not expierence? thanks please advise what to do

  Read the article

• Data structure name: combination array/linked list

  - by me_and

  I have come up with a data structure that combines some of the advantages of linked lists with some of the advantages of fixed-size arrays. It seems very obvious to me, and so I'd expect someone to have thought of it and named it already. Does anyone know what this is called: Take a small fixed-size array. If the number of elements you want to put in your array is greater than the size of the array, add a new array and whatever pointers you like between the old and the new. Thus you have: Static array ————————————————————————— |1|2|3|4|5|6|7|8|9|a|b|c| ————————————————————————— Linked list ———— ———— ———— ———— ———— |1|*->|2|*->|3|*->|4|*->|5|*->NULL ———— ———— ———— ———— ———— My thing: ———————————— ———————————— |1|2|3|4|5|*->|6|7|8|9|a|*->NULL ———————————— ————————————

  Read the article

• Programmatically determine the relative "popularities" of a list of items (books, songs, movies, etc

  - by Horace Loeb

  Given a list of (say) songs, what's the best way to determine their relative "popularity"? My first thought is to use Google Trends. This list of songs: Subterranean Homesick Blues Empire State of Mind California Gurls produces the following Google Trends report: (to find out what's popular now, I restricted the report to the last 30 days) Empire State of Mind is marginally more popular than California Gurls, and Subterranean Homesick Blues is far less popular than either. So this works pretty well, but what happens when your list is 100 or 1000 songs long? Google Trends only allows you to compare 5 terms at once, so absent a huge round-robin, what's the right approach? Another option is to just do a Google Search for each song and see which has the most results, but this doesn't really measure the same thing

  Read the article

• Level Order Successor of node in BST

  - by dsiap

  How can we find level order successor of a node in bst if parent pointer is given(with out using Queue ) ?

  Read the article

• Algorithms after load-balancer?

  - by Vimvq1987

  I need to study about load-balancers, such as Network Load Balancing, Linux Virtual Server, HAProxy,...There're somethings under-the-hood I need to know: What algorithms/technologies are used in these load-balancers? Which is the most popular? most effective? I expect that these algorithms/technologies will not be too complicated. Are there some resources written about them? Thank you very much for your help.

  Read the article

• question on cryptography

  - by davit-datuashvili

  let say we have string t i have question why this does not work t.charAt(i)+=3; where i changes from 0 to t.length()

  Read the article

• Loop through different sets of unique permutations

  - by user558610

  Hi I'm having a hard time getting started to layout code for this problem. I have a fixed amount of random numbers, in this case 8 numbers. R[] = { 1, 2, 3, 4, 5, 6, 7, 8 }; That are going to be placed in 3 sets of numbers, with the only constraint that each set contain minimum one value, and each value can only be used once. For example: R1[] = { 1, 4 } R2[] = { 2, 8, 5, 6 } R3[] = { 7, 4 } I need to loop through all possible combinations of a set R1, R2, R3. Order is not important, so if the above example happened, I don't need R1[] = { 4, 1 } R2[] = { 2, 8, 5, 6 } R3[] = { 7, 4 } NOR R1[] = { 2, 8, 5, 6 } R2[] = { 7, 4 } R3[] = { 1, 4 } What is a good method?

  Read the article

• question about permut-by-sorting

  - by davit-datuashvili

  hi i have following question from book introduction in algorithms second edition there is such problem suppose we have some array A int a[]={1,2,3,4} and we have some random priorities array P={36,3,97,19} we shoud permut array a randomly using this priorities array here is pseudo code P ERMUTE -B Y-S ORTING ( A) 1 n ? length[A] 2 for i ? 1 to n do P[i] = R ANDOM(1, n 3 ) 3 4 sort A, using P as sort keys 5 return A and result will be permuted array B={2, 4, 1, 3}; please help any ideas i have done this code and need aideas how continue import java.util.*; public class Permut { public static void main(String[]args){ Random r=new Random(); int a[]=new int[]{1,2,3,4}; int n=a.length; int b[]=new int[a.length]; int p[]=new int[a.length]; for (int i=0;i<p.length;i++){ p[i]=r.nextInt(n*n*n)+1; } // for (int i=0;i<p.length;i++){ // System.out.println(p[i]); //} } } please help

  Read the article

• Common strategies to deal with rounding errors in currency-intensive soft?

  - by Max

  What is your advice on: compensation of accumulated error in bulk math operations on collections of Money objects. How is this implemented in your production code? (things like variable rounding, etc...) theory behind rounding in accountancy. any literature on topic. I currently read Fowler. He mentions Money type, but says nothing on strategies. Older posts on money-rounding (here, and here) do not provide a details and formality I need. Thanks for help.

  Read the article

• An interview question on array comparison

  - by user288084

  There are two arrays with equivalent size. How to decide whether these two arrays contain the same set of elements, but the orders of these elements in the respective arrays are different. For instance. A = [a, b, c] B= [b, c, a]

  Read the article

• How to trim minutes and hours and seconds from Date object?

  - by Roman

  I need to make map where Dates are keys. 2 date objects are equals if they have the same value of getTime() method. I'm interested only in year, month and day. How can I trim unnecessary hours and minutes to get 'clear' dates?

  Read the article

• binary number comparison

  - by EquinoX

  If I have a 32 bit two's complement number and I want to know what is the easiest way to know of two numbers are equal... what would be the fastest bitwise operator to know this? I know xor'ing both numbers and check if the results are zero works well... any other one's? how about if a number is greater than 0?? I can check the 31'st bit to see if it's greater or equal to 0..but how about bgtz?

  Read the article

• programmatically get BPM of a wave or MP3 from .Net

  - by BS

  I have a project with a requirement to get the BPM of a wave or MP3 file programmatically using .Net (VB.Net or C#). Does anyone know of a binary or library for this or have a code snippet to steer me in the right direction?

  Read the article

• fill array with binary numbers

  - by davit-datuashvili

  hi, first of all this is not homework!! my question is from book: Algorithms in C++ third edition by robert sedgewick question is: there is given array of size n by 2^n(two dimensional) and we should fill it by binary numbers with bits size exactly n or for example n=5 so result will be 00001 00010 00011 00100 00101 00110 00111 and so on we should put this sequence of bits into arrays please help me

  Read the article

• At which n does binary search become faster than linear search on a modern CPU?

  - by joeforker

  Due to the wonders of branch prediction, a binary search can be slower than a linear search through an array of integers. On a typical desktop processor, how big does that array have to get before it would be better to use a binary search? Assume the structure will be used for many lookups.

  Read the article

• how would you sort n sorted lists with average length K in O(n*log K) time?

  - by SS

  how would you sort n sorted lists with average length K in O(n*log K) time?

  Read the article

• How is PI calculated?

  - by user146780

  I want to make a function in C that can return PI to X places.. ex: CalcPi(0) = 3 CalcPi(1) = 3.1 CalcPi(2) = 3.14 etc... I'm just not sure how... Thanks

  Read the article

• SQL algorithm question to convert a table

  - by every_answer_gets_a_point

  i have a table like this: 1 x y 2 a 3 b 4 c d e i want to use a sql statement to turn it into this: 1 x 1 y 2 a 3 b 4 c 4 d 4 e i am having trouble building the sql statement. please help!

  Read the article

• question about random select

  - by davit-datuashvili

  here is code print number in decreasing order import java.util.*; public class select { public static void Select(int m,int n){ Random r=new Random(); if (m>0) if (r.nextInt(0x3fff8001) % n <m ){ System.out.println(n-1); Select(m-1,n-1); } else{ Select(m,n-1); } } public static void main(String[]args){ int m=35; int n=200; Select(m,n); } } and question is how to changes code such that print number in increasing order? please help

  Read the article

• How can I detect common substrings in a list of strings

  - by danio

  Given a set of strings, for example: EFgreen EFgrey EntireS1 EntireS2 J27RedP1 J27GreenP1 J27RedP2 J27GreenP2 JournalP1Black JournalP1Blue JournalP1Green JournalP1Red JournalP2Black JournalP2Blue JournalP2Green I want to be able to detect that these are three sets of files: EntireS[1,2] J27[Red,Green]P[1,2] JournalP[1,2][Red,Green,Blue] Are there any known ways of approaching this problem - any published papers I can read on this? The approach I am considering is for each string look at all other strings and find the common characters and where differing characters are, trying to find sets of strings that have the most in common, but I fear that this is not very efficient and may give false positives. Note that this is not the same as 'How do I detect groups of common strings in filenames' because that assumes that a string will always have a series of digits following it. [Edited 15/09/09 to add more sample strings]

  Read the article

• How can I find the boundaries of a subset of a sorted list?

  - by Alex

  I have the following dilemma: I have a list of strings, and I want to find the set of string which start with a certain prefix. The list is sorted, so the naive solution is this: Perform binary search on the prefixes of the set, and when you find an element that starts with the prefix, traverse up linearly until you hit the top of the subset. This runs in linear time, however, and I was wondering if anyone can suggest a more efficient way to do it.

  Read the article

• finding an element of in a sorted array thats shifted

  - by hao

  Say the original list is 1 2 3 4 5 6 7 8 9 10 and u shift it so that it becomes 5 6 7 8 9 10 1 2 3 4 so say i want to check if 7 is in the array. how would i do this efficiently.

  Read the article

• question about char array

  - by davit-datuashvili

  i have question about char array how declare in java array of char from a to z ? i mean char characters []=new char[]{a....z]? thank

  Read the article

• Search inside dynamic array in python

  - by user2091683

  I want to implement a code that loops inside an array that its size is set by the user that means that the size isn't constant. for example: A=[1,2,3,4,5] then I want the output to be like this: [1],[2],[3],[4],[5] [1,2],[1,3],[1,4],[1,5] [2,3],[2,4],[2,5] [3,4],[3,5] [4,5] [1,2,3],[1,2,4],[1,2,5] [1,3,4],[1,3,5] and so on [1,2,3,4],[1,2,3,5] [2,3,4,5] [1,2,3,4,5] Can you help me implement this code?

  Read the article

• Need Multiple Sudoku Solutions

  - by user1567909

  I'm trying to output multiple sudoku solutions in my program. For example, when You enter this as input: 8..6..9.5.............2.31...7318.6.24.....73...........279.1..5...8..36..3...... .'s denote blank spaces. Numbers represent already-filled spaces. The output should be a sudoku solution like so: 814637925325149687796825314957318462241956873638274591462793158579481236183562749 However, I want to output multiple solutions. This would be all the solutions that should be printed: 814637925325149687796825314957318462241956873638274591462793158579481236183562749 814637925325941687796825314957318462241569873638472591462793158579184236183256749 834671925125839647796425318957318462241956873368247591682793154579184236413562789 834671925125839647796524318957318462241956873368247591682793154519482736473165289 834671925125839647796524318957318462241965873368247591682793154519482736473156289 But my program only prints out one solution. Below is my recursive solution to solving a sudoku solution bool sodoku::testTheNumber(sodoku *arr[9][9], int row, int column) { if(column == 9) { column = 0; row++; if(row == 9) return true; } if(arr[row][column]->number != 0) { return testTheNumber(arr, row, column+1); } for(int k = 1; k < 10; k++) { if(k == 10) { arr[row][column]->number = 0; return false; } if(rowIsValid(arr, k, row) && columnIsValid(arr, k, column) && boxIsValid(arr, k, row, column)) { arr[row][column]->number = k; if(testTheNumber(arr, row, column+1)==true) { return true; } arr[row][column]->number = 0; } } return false; } Could anyone help me come up with a way to print out multiple solutions? Thanks.

  Read the article

< Previous Page | 96 97 98 99 100 101 102 103 104 105 106 107  | Next Page >