w3hello.com logo
Home PHP C# C++ Android Java Javascript Python IOS SQL HTML videos Categories
Finding the row with the highest average in a numpy array
You don't need to worry about the 0s, they shouldn't effect how the averages compare since there will presumably be one in each row. Hence, you can do something like this to get the index of the row with the highest average: >>> import numpy as np >>> complete_matrix = np.array([ ... [0, 1, 2, 4], ... [1, 0, 3, 5], ... [2, 3, 0, 6], ... [4, 5, 6, 0]]) >>> np.argmax(np.mean(complete_matrix, axis=1)) 3 Reference: numpy.mean numpy.argmax

Categories : Python

Average of 2d list by only adding single row and finding the average of that single row
>>> L = [['x','y',1], ['x','y',1], ['x','y',2]] >>> sum(entry[-1] for entry in L) / float(len(L)) 1.3333333333333333 This is same as: >>> sum(entry[2] for entry in L) / float(len(L)) since the last position is index 2.

Categories : Python

what is the average time, that an average process, running on an average kernel, using an average scheduler, gets in one active cycle?
Linux uses 100 milliseconds as the scheduler quantum, if that's what you were asking, in your own, convoluted way :-) There's nothing saying a process has to use their entire quantum and, in fact, if they release early, I think their priority gets bumped up a bit as a reward.

Categories : C

Finding an average SQL
I'm going to guess a little bit on what's going on from your comment, so I think your JOIN is off a bit. Try this: Select Company.company_id, company.Company_Name, avg(UserJobRating.Total_Rating) from company inner join jobs on jobs.Company_id = company.company_id inner join UserJobRating on jobs.Job_id = UserJobRating.Job_ID group by company.company_id SQL Fiddle Demo Without seeing your table definitions, this is a bit of a guess, but I would bet you're producing a Cartesian Product with the UserJobRating table with this statement: on Job_id = UserJobRating.Job_ID

Categories : Mysql

SQL finding average between dates
Declare @dt_to datetime Declare @dt_from datetime set @dt_to = convert(datetime,'2013-7-8') set @dt_from = convert(datetime,'2013-7-15') Update tableName Set avg_paid_volume = (cns_amt / datediff(d,@dt_to,@dt_from)) datediff is key here

Categories : SQL

Finding the average of n numbers with Python
You only need one loop to work. Just ask you question, get the input, and loop. When you enter no, then the loop will exit and compute your average. print("This program 'is' designed to find the average of n numbers you input ") #print statement that introduces the average finder counter = 0 #this counter will count how many numbers the user has inserted into the program and will be used as denominator sum_of_numbers = 0 #this number is set as 0 as currently the sum is 0, as more numbers are inputed, they will be added together first_question = input('''Would you like to enter a number? Type "yes" if you do, and "no" if you don't. ''') #takes input of yes or no to see whether user wants to find average of numbers while first_question == "yes" : ent_num = int(input("Enter y

Categories : Python

Finding Average using nested queries on another table
Here's an example that you can execute in LINQPad EDIT: updated to show handling of nulls for sub query void Main() { var restaurants = new List<Restaurant>(); restaurants.Add(new Restaurant(1, "McDonalds")); restaurants.Add(new Restaurant(2, "Wendy's")); restaurants.Add(new Restaurant(3, "KFC")); var comments = new List<Comment>(); comments.Add(new Comment(1, 1, "I love clowns!", 9.5)); comments.Add(new Comment(2, 1, "Disgusting", 1.0)); comments.Add(new Comment(3, 1, "Average", 5.0)); comments.Add(new Comment(4, 2, "Hmmm tasty", 8.5)); comments.Add(new Comment(5, 2, "Yuck", 4.0)); // Edit - removed comment for KFC, updated code below to handle nulls var restaurantsWithRatings = restaurants.Select(r => new { Re

Categories : C#

Finding average file size in MB in given directory
You could use the Average extension method: // using System.Linq; string filePath = @"DesiredFilePath"; double averageFileSize = Directory .EnumerateFiles(filePath) .Average(x => new FileInfo(x).Length);

Categories : C#

having issues with finding the average run time of a block
Your method is mostly ok so far, except you don't need to branch out i == 1 from i > 1 – { 1.times { yield } is functionally equivalent to just calling yield. yield doesn't return anything on its own. It is a keyword that indicates the block given to the method should be called, and can optionally be fed variables that would in turn get passed to the block, e.g: class String def each_character_in_reverse_order each_char.to_a.reverse_each do |char| yield char end end end "hello".each_character_in_reverse_order do |c| puts c.upcase end #=> # O # L # L # E # H In the case of the tests you've linked to, the return values of the blocks are complete inconsequential, as they are only interested in how long it takes to run the block. But as you can see in the exa

Categories : Ruby

Python: Finding the average stock value for each month
Inside the if loop the sum_float and count are not made a 0, so as a program proceeds the average goes for multiple months. So try doing that and it should solve your problem. Also one more point with your logic is that are you that whether your list of tuples is sorted one if not it can lead to complications with regards to your logic.

Categories : Python

Finding average of last 3 not null values from sqlite database
I'm going to assume you have a column to_order which contains the order you want to retrieve the rows in and col which contains your numbers: select avg(col) from tbl where col is not null order by to_order desc limit 3; If you have further questions, leave a comment.

Categories : Android

Finding the average length of a column as per a particular case in MySQL
I prefer the length() inside the case: SELECT u.id, AVG(LENGTH(m.body)) AS avg_msg_length, AVG(CASE WHEN m.is_retired = 'Y' THEN LENGTH(m.body) END) AS avg_msg_length_retired FROM Users u LEFT OUTER JOIN Messages m ON u.id = m.sender_id GROUP BY u.id; The 'Y' should be whatever character or string indicates truth. The problem with your query is that you are mixing character expressions (is_retired) with numeric expressions (true). Be consistent with the types. For instance, this evaluates to false: select 'true' = true; But this evaluates to true: select 1 = true;

Categories : Mysql

Finding the average of double values from the command line?
You probably meant: for (int i = 0; i < args.length; i++) As this is the main logical issue here, there are other (syntactic) problems that needs to be addressed, that others have mentioned (see @seanmk's answer, for instance, on the importance of scoping loops). (Note: this was written before @seanmk's answer was updated with additional information, when it only regarded the issue of brackets and scoping of loops).

Categories : Java

Finding Average of value based on count of rows in LINQ
You could just use average: var average = (from a in db.Reviews where a.ReviewsRestaurantID.Equals(id) select a.ReviewsRating).Average(); You could also do it with aggregate like this (if what you really want to do is more complicated, here is an example implementation of average): var result = db.Reviews.Where(r => r.ReviewsRestaurantID = id) .Aggregate(new () { total = 0, count = 0, avg = 0.0 }, (o, n) => { var result = new () { total = o.total+n.ReviewsRating, count = o.count+1, avg = 0.0}; result.avg = result.total / result.count; return result; }, (r) => r.avg);

Categories : C#

UIImage and Finding the Average UIColor of Center Pixels
You are only iterating the pixels from startPoint to one less of endPoint. Maybe using for(int row = yStartPoint; row <= yEndPoint; row++) // ... for(int column = xStartPoint; column <= xEndPoint; column++) will fix it? Also you will have to adjust your rowPtr to start at your xStartPoint: const UInt8 *rowPtr = rawPixelData + bytesPerRow * row + stride * xStartPoint; Else you will be starting at x = 0 every row. And your average should be calculated like so: int numberOfPixels = (yEndPoint - yStartPoint) * (xEndPoint - xStartPoint); red /= numberOfPixels; green /= numberOfPixels; blue /= numberOfPixels; return [UIColor colorWithRed:red / 255.0 green:green / 255.0 blue:blue / 255.0 alpha:1.0f];

Categories : IOS

To stop finding running average once the condition fails?
sub = [767220, 769287, 770167, 770276, 770791, 770835, 771926, 1196500, 1199789, 1201485, 1206331, 1206467, 1210929, 1213184, 1213204, 1213221, 1361867, 1361921, 1361949, 1364886, 1367224, 1368005, 1368456, 1368982, 1369000, 1370365, 1370434, 1370551, 1371492, 1471407, 1709408, 1710264, 1710308, 1710322, 1710350, 1710365, 1710375] def runningMean(seq, n=0, total=0): #function called recursively if not seq: return [] total = total + int(seq[-1]) if int(seq[-1]) < total/float(n+1) * 0.9: # Check your condition to see if it's time to stop averaging. return [] return runningMean(seq[:-1], n=n+1, total=total) + [total/float(n+1)] avg = runningMean(sub, n = 0, total = 0) print avg print sub[-len(avg):]

Categories : Python

Reading a text file of student names and text scores and finding an average
Oops: int i =Integer.parseInt ("TS"); This doesn't make sense. What number is "TS" supposed to represent? Edit: you state: I know that TS is not a valid number that's why I was trying to cast it to a number You can't "cast" letters to a number, again it makes no sense. You need to read in the Strings in the file and then parse those Strings, not some letters you make up. What your code should do is: read in each line in the file in a for loop inside this loop, split the String using String's split(" ") method. Use Integer.parse(...) to parse the 3rd item in the array returned. So would I use Integer.parse(String [] TS)? No, this won't even compile since you're trying to pass a String array into a method that takes a String parameter.

Categories : Java

Average of array with two objects
you can use linq for this, something along the lines of var average = readings.Average(r => r.value); Note: Average Computes the average of a sequence of numeric values. MSDN Link: http://msdn.microsoft.com/en-us/library/system.linq.enumerable.average.aspx

Categories : C#

mongoDB - average on array values
Positional notation in aggregation seems to still be unsupported, check out this ticket. As @Sammaye says you'd need to either unwind the array first, or replace your coordinates array with an embedded lng/lat embedded doc, which would make this trivial. Given the array structure, you might unwind and project the lat/lng like this: myColl.aggregate([ // unwind the coordinates into separate docs {$unwind: "$myCoordinates"}, // group back into single docs, projecting the first and last // coordinates as lng and lat, respectively {$group: { _id: "$_id", lng: {$first: "$myCoordinates"}, lat: {$last: "$myCoordinates"} }}, // then group as normal for the averaging {$group: { _id: 0, lngAvg: {$avg: "$lng"}, latAvg: {$avg: "$lat"} }} ]);

Categories : Arrays

Calculate the average of points in a array - Javascript
Try the following: function groupAverage(group) { var sum = 0; var count = group.length; for (var i in group) { sum += parseInt(group[i].split(',')[2], 10); } return sum / count; }

Categories : Javascript

12 month moving average from Java array
the problem with this code is that it outputs the moving average as the values converted to double That is to be expected, since you calculated the averages as doubles. If you simply want to convert the double averages to integers, then use Math.round(double); e.g. System.out.println(i + " " + k + " " + Math.round(a.avgNumerator[i]));

Categories : Java

ECMA5 array methods - Finding the first object of a kind in an array
There isn't a built-in method for that in ES5. ES6 is adding Array.prototype.find for this http://people.mozilla.org/~jorendorff/es6-draft.html#sec-22.1.3.8 console.log(things.find(getBob)); Here's a polyfill adapted from https://gist.github.com/dcherman/5167353 (function() { function polyfill(fnName) { if (!Array.prototype[fnName]) { Object.defineProperty(Array.prototype, fnName, { value: function( predicate /*, thisArg */ ) { var i, len, test, thisArg = arguments[ 1 ]; if ( typeof predicate !== "function" ) { throw new TypeError(); } test = !thisArg ? predicate : function() { return predicate.apply( thisArg, arg

Categories : Javascript

ArrayIndexOutOfBoundsException while calculating Mean / Average values from array of pixels
You don't show the stack trace (edit: now you do, thanks), which would indicate which line is throwing the exception. However at first glance it appears your issue is here: for (int x = 0; x < width; x++) { for (int y = 0; y < height; y++) { int index = 0; for (int filterX = -filterWidth / 2; filterX < filterWidth / 2; filterX++) { for (int filterY = -filterHeight / 2; filterY < filterHeight / 2; filterY++) { A = (pixels[x+filterX+width*(y+filterY)])>>24 & 0xFF; R = (pixels[x+filterX+width*(y+filterY)] >> 16) & 0xFF; G = (pixels[x+filterX+width*(y+filterY)] >> 8) & 0xFF; B = pixels[x+filterX+width*(y+filterY)] & 0xFF; ...

Categories : Java

numpy array: replace nan values with average of columns
This isn't very clean but I can't think of a way to do it other than iterating #example a = np.arange(16, dtype = float).reshape(4,4) a[2,2] = np.nan a[3,3] = np.nan indices = np.where(np.isnan(a)) #returns an array of rows and column indices for row, col in zip(*indices): a[row,col] = np.mean(a[~np.isnan(a[:,col]), col])

Categories : Python

SQL query to compare individual average with a group average
You don't need the first ; since it is a statement terminator. Change this : SELECT Person, Avg(Score) AS PersonAverage FROM TblScores GROUP BY Person HAVING (((Avg(Score))>(SELECT Avg(Score) AS AverageOfAllScores FROM TblScores;))); with this : SELECT Person, Avg(Score) AS PersonAverage FROM TblScores GROUP BY Person HAVING (((Avg(Score))>(SELECT Avg(Score) AS AverageOfAllScores FROM TblScores)));

Categories : Mysql

Finding matching objects in array: array or object
My guess is you're a Java or C++ programmer because your thinking is class-centric. The Ruby way is duck typing. For classification pairing to work, you need only know if the items in a list respond_to? a type method and a pairedby=. It would be pretty standard Ruby to implement this operation as a mix-in on arrays. You should probably not split such simple functionality across two classes unless there is a need to access the inner function, i.e. pair_with_next. One reason: By splitting the function you pretty much doom yourself to O(n^2) performance when O(n) is trivial to obtain. Make one pass. Keep a queue of A indexes. When you see a B, remove the head index from the queue. That's the A that matches the current B. Continue until complete. If the queue is empty, assign nil

Categories : Ruby

Finding a way to create a list of array from another complex array
use array_merge_recursive for example $ar1=array('color'=>"green"); $ar2=array('color'=>"blue"); $result = array_merge_recursive($ar1, $ar2); output : Array ( [color] => Array ( [0] => green [1] => blue ) )

Categories : PHP

Have user enter scores or check grade average in 2 dimensional array?
Here'a a hard to catch bug in your code: while (keepGoing); The correct way to declare a loop is this: while (keepGoing) { // body } That ; at the end of the loop condition has the effect of creating a loop without a body, so nothing is being repeated! the code below the loop is executing exactly once.

Categories : Java

Is n operations of O(1) average time each considered O(n) in average?
Given that you are traversing all your array the second time, yes that is O(n) * O(1) (and not O(n)+O(1) as previously stated from me) (for hash lookup in average time), so you are talking about an algorithm of O(n) complexity .

Categories : Database

Finding missing array in array of arrays
I hope that this helps you, function findDeselectedItem(CurrentArray, PreviousArray) { var CurrentArrSize = CurrentArray.length; var PreviousArrSize = PreviousArray.length; var deselectedItem = []; // loop through previous array for(var j = 0; j < PreviousArrSize; j++) { var checkArray = PreviousArrSize[j]; // loop through 2nd array to match both array for(var i = 0; i < CurrentArrSize; i++) { // look for same thing in new array if (CurrentArray[i].indexOf(checkArray) == -1) deselectedItem.push(CurrentArray[i]); } } return deselectedItem; }

Categories : Javascript

finding if the strings in an array is exists in another array
Do : for (int y = 0; y < question.length; y++) { } instead of <=. The problem outcomes from the fact you don't have a question[question.length] element. Also, I don't see where you declare the y variable. Update: Here's a complete sample: String[] questions = {"adorable", "able", "adventurous"}; String u = "able adorable asd"; String[] t = u.split(" "); for (int y = 0; y < questions.length; y++) { for (int w = 0; w < t.length; w++) { if (t[w].equals(questions[y])) { System.out.print(t[w] + " "); break; } } } This prints: adorable able

Categories : Java

How to select subarrays in numpy 1D array with minimal, average and maximal area values?
For max: areasplit[argmax(sum(areasplit==0, axis=0)), :] replace argmax with argmin for min: have you considered there may be several array meet you criteria? Example: >>> from numpy import * >>> a=array(range(81)) >>> b=split(a, 9) >>> b#be careful it is a list of arrays not just an array [array([0, 1, 2, 3, 4, 5, 6, 7, 8]), array([ 9, 10, 11, 12, 13, 14, 15, 16, 17]), array([18, 19, 20, 21, 22, 23, 24, 25, 26]), array([27, 28, 29, 30, 31, 32, 33, 34, 35]), array([36, 37, 38, 39, 40, 41, 42, 43, 44]), array([45, 46, 47, 48, 49, 50, 51, 52, 53]), array([54, 55, 56, 57, 58, 59, 60, 61, 62]), array([63, 64, 65, 66, 67, 68, 69, 70, 71]), array([72, 73, 74, 75, 76, 77, 78, 79, 80])] >>> b=array(split(a, 9)) #I prefer to use b.reshape((-1,9)

Categories : Python

What is wrong with this code? program that outputs minimum, maximum and average of integers in C using Array
your for loop is wrong for(i=1; i++;) this should be for(i=1;i<5; i++) //because you already scanned a[0].. you need to scan till a[4] use avg=a[0]; instead of avg=0; in for loop you need to write use if (a[i]<min) instead of else Modified code #include <stdio.h> void main() { int i,a[5],min,max; float avg; printf(" Enter any number : "); scanf("%d",&a[0]); max=a[0]; min=a[0]; avg=a[0]; for(i=1;i<5;i++) { printf(" Enter any0 Number : "); scanf("%d",&a[i]); if(a[i]>max) max=a[i]; if( a[i]< min ) min=a[i]; avg=avg+a[i]; }

Categories : C

Finding sub-array sum in an integer array
When S is not too large, we can count the distinct sums with one (fast) polynomial multiplication. When S is larger, N is hopefully small enough to use a quadratic algorithm. Let x_1, x_2, ..., x_n be the array elements. Let y_0 = 0 and y_i = x_1 + x_2 + ... + x_i. Let P(z) = z^{y_0} + z^{y_1} + ... + z^{y_n}. Compute the product of polynomials P(z) * P(z^{-1}); the coefficient of z^k with k > 0 is nonzero if and only if k is a sub-array sum, so we just have to read off the number of nonzero coefficients of positive powers. The powers of z, moreover, range from -S to S, so the multiplication takes time on the order of S log S.

Categories : Algorithm

SQLite select average from one table and update average field from another table using trigger
To compute the average value of a specific field dynamically, use this query: SELECT AVG(value) FROM table_1 WHERE field = 'field_a'; If you want instead a view that looks like your table_2, you can define it like this: CREATE VIEW view_2 AS SELECT field, AVG(value) AS average_value FROM table_1 GROUP BY field; If you really want table_2 to be an actual table, you could compute the average values like this: UPDATE table_2 SET average_value = (SELECT AVG(value) FROM table_1 WHERE table_1.field = table_2.field); If you want table_2 to be an actual table, and want to update only those values that have changed, use a trigger like this: CREATE TRIGGER update_average_value_after_insert AFTER INSERT ON table_1 FOR EACH ROW BEGIN UPDATE

Categories : SQL

Finding the first non-Nil element in an array
You can use Enumerable#find: @group_list.find { |x| !x["list"].blank? } #=> first non-nil and non-empty list in group_list

Categories : Ruby

Finding smallest value in array
array1.Min() See this With the Min method we find the minimum element or the minimum value after a transformation.

Categories : C#

Finding result in a PHP Array
$yourlike is not mysqli_result. Replace this line $likearray = mysqli_fetch_array($con, $yourlike); with this one $likearray = mysqli_fetch_array($con, $check_like_res);

Categories : PHP

Finding parent in PHP Array
Try: foreach ($arr as $key => $value) { foreach ($value["children"] as $child) { if ($child["id"] == $you_look_for) return $key; // or $value["id"] ? } } This - however - will only return the first id of an array containing a child with id $you_look_for.

Categories : PHP

Finding index of a value in an array
Of course it's possible. Computers are amazing. var positions = []; for (var i = 0; i < arr.length; ++i) if (arr[i] === 69) positions.push(i); At the end of that loop, the array "positions" will contain all the indexes of the array where 69 was found. You could generalize this: function indexes(arr, value) { var rv = []; for (var i = 0; i < arr.length; ++i) if (arr[i] === value) rv.push(i); return rv; } and then: var i69 = indexes(arr, 69);

Categories : Javascript



© Copyright 2017 w3hello.com Publishing Limited. All rights reserved.