im coding in c and with a prototype of: Data* bubble_sort(Data *list); I'm trying to Implement a bubble sort given a linked list of names. Note: this returns functions the new modified head back to the caller. In case the head has been updated with ...

The code below is sort of complicated to explain... It writes a "sphere" of data to a 3D array from the given 3D-Position outwards in a spherical shape based on the given radius and value to write. A graphical representation of this would be: double UbytePrism :: PrismSphereSet( uint64 Xpos ,...

So I wanted to write a Makefile that would allow for module specific rules or just make some standard rules for a module. I started writing this with, if I'm honest, no idea about makefiles. The idea was essentially that each module would be a folder in the $(SRCDIR), if there is a make file nam...

got question at work about improving the D.js library performance-wise. I m a FE dev for a year, but i mostly do stuff like dom manipulation and simple ajax. I know what promise is, no xp on the topic though. Went over A+ specification(http://promises-aplus.github.io/promises-spec/) and the code...

I have the following function that creates an array of JSON objects with properties from an array of arrays, where the first 'row' in the array contains the keys. It works, but could it be improved? var myArray = [ ["a","b","c","d"], // will become keys [1,2,3,4], ["foo","bar","baz...

If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23. Find the sum of all the multiples of 3 or 5 below N. #include <stdio.h> int main(){ int i=0,j,k,l,sum=0; scanf("%d",&i); if(i<=100000&&i>0){ for(...

In my Android app I have number of methods that should be executed in a background thread. One of the methods looks like this public static void processItem(final Context context, final String itemId) { if (Looper.myLooper() == Looper.getMainLooper()) { Thread task = new Thread...

I have a multithread application and in it I have a List<string> with about a million data in it. I want to split it into multiple small list objects so that it won't take much memory.

I am creating a vector class which can be manipulated on the GPU and I am using C++AMP for the GPU accelerated code. I am wondering the most efficient way of assigning elements of a different type to a concurrency::array in C++AMP. There are two ways that I can think of (but there may be more):...

Why can't I call myCar.engine or any of it's properties in the following code? var Car = function(make, model, engineSize, horse) { this.make = make; this.model = model; this.engine = function(engineSize, horse) { this.size = engineSize; this.horse = horse; getSize = function()...

Ignoring my shocking use of the mysql_* extension (and any associated issues), could you take a look at my script that uploads an image, adds it to a database, creates a thumbnail of the image 578px in width, and adds that to the database too. <?php require_once("validate.php"); while ($hq = my...

N,K,P = map(int,raw_input().split(' ')) # N: No of Inputs, K: highest possible jump, P: no of test cases L = map(int,raw_input().split(' ')) # Takes in the N space separated inputs Li = sorted(L) Breaks = [] #Records the starting point a of pair a,b such that the jump from a to b is larger than k...

I have a small script that takes a list of objects from an SQL table and groups them if the date-time on the object has less than 60 second difference with the last object. It does this by converting the date-time to epoch and then subtracting the epoch of the previous object from the epoch of ...

Is there a better way (I'm pretty sure there is) to create a stored procedure to do dynamic paging, filtering and sorting than the following code? CREATE PROCEDURE [uspProductWithPagingSortingFiltering] ( -- Optional Filters for Dynamic Search @ProductID INT = NULL, @Name NAME = NULL, @ProductNu...