implementation

I have written a BigInteger class in C++ that should be able to do operations on all numbers with any size. Currently I am trying to achieve a very fast multiplication method by comparing the existing algorithms and test for which amount of digits they work best and I ran into very unexpected results.I tried to do 20 multiplications of 500-digit and I timed them. This was the result: karatsuba: 14.178 seconds long multiplication: 0.879 seconds Wikipedia told me It follows that, for sufficiently large n, Karatsuba's algorithm will perform fewer shifts and single-digit additions than longhand

I am having my entity framework context in a separate EL Layer, which stands for Entity Layer and then I move to DAL, then BL and my user inteface aspx.cs code page. I am confused as such how to use IDisposable in the same. What I am doing till now, supopose in my DAL I have context of my entities. namespace abc { public class Action: IDisposable { Entities context = new Entities(); // all the methods public void Dispose() { context.Dispose(); } } } Is it the correct way of doing so? I am just a naive programmer so help me in learning the same logic. Personally I would change it a little bit,

I downloaded SDL 1.2.14 on Windows 7 and I have Mobility Radeon X1800 driver installed. I'm using Microsoft Visual C++ 2010 Express. I added the SDL include and library directories in the "VC++ Directories" I added the following Additional Dependencies: opengl32.lib; glu32.lib; SDL.lib; SDLmain.lib; I added the SDL.dll to my program folder I didn't add any opengl directories! #include "SDL.h" #include "SDL_opengl.h" bool running = true; int main(int argc, char* args[]) { SDL_Init(SDL_INIT_EVERYTHING); SDL_Surface* screen = SDL_SetVideoMode(640,480,32,SDL_OPENGL); glViewport(0,0,640,480);

I am interested in the implementation of the MapReduce sort phase; it seems to be very efficient. Could someone provide some references about it please? Thanks! This points to ReduceTask.java as the place where sort phase is coded. See lines 393-408 in ReduceTask.java . If you need more info, download the entire source and dig into it. EDITED "Sort" phase falls under ReduceTask as shown in this figure below from hadoop book . (Page no: 163) 来源： https://stackoverflow.com/questions/9363761/how-does-mapreduce-framework-implement-the-sort-phase

I want to implement a ranking system on a website I've been working on and have decided to go with the Hacker News algorithm. My reasoning for choosing this algorithm is simply because it's been described here . I was looking at this Python code (the language I'm using to build my site) and couldn't figure out how I would implement it. def calculate_score(votes, item_hour_age, gravity=1.8): return (votes - 1) / pow((item_hour_age+2), gravity) Given the tables: posts: id | title | time_submitted votes: id | postid | userid | score How would I pull the data from the database? The ideal solution

I have been asked to automate a particular task at work today which takes up a lot of our time! The following is what needs to be done and I would appreciate any help on how I can do this (Implementation Advice) within the realms of my knowledge, if possible. Problem I have a PowerPoint document (.ppt). I would like to extract text from there (the text is in bullet point format). I would like to insert these bullets points into an Excel sheet, each bullet point should be a row. I would also like to put in the adjacent column the page this bullet point text was taken from. So, basically: