Search Results

Search found 1337 results on 54 pages for 'sorted'.

Page 22/54 | < Previous Page | 18 19 20 21 22 23 24 25 26 27 28 29  | Next Page >

• How can i access recent 10 values from cassandra super column

  - by urssujith

  How can i access recent 10 values from cassandra. i need to get the recent values from a particular super column. I am getting the result, but which is not sorted properly. i need to sort the result with descending order(latest first based on the column name/timestamp)

  Read the article

• SQL to have one specific record at the top, all others below

  - by superdario

  Hey all, I am trying to put together a query that will display one specific record (found by the record's primary ID) at the top, and display all other records below it, sorted by date (I have "date_added" as one of the fields in the table, in addition to primary ID). I could do this with a UNION (first select would locate the record I want, and the other select would display all other records), but I'm wondering if is there perhaps a better way? I'm using Oracle, by the way.

  Read the article

• How to I display a sort arrow in the header of a list view column using C#?

  - by Andrew Moore

  How can I display a sort arrow in the header of the sorted column in a list view which follows the native look of the operating system?

  Read the article

• How do i parse a map (foreach) in the same order i created it (JAVA)

  - by user348058

  So i have a map that i created (inserted data) in an order i wanted. When parsing the map the 1st key returned in foreach is not the first key i inserted. Is there a way for that to happen? Also sorting my map is kinda tricky cause it has to be sorted by Value and in specific field within the Value. Ty

  Read the article

• Sorting a list of numbers with modified cost

  - by David

  First, this was one of the four problems we had to solve in a project last year and I couldn’t find a suitable algorithm so we handle in a brute force solution. Problem: The numbers are in a list that is not sorted and supports only one type of operation. The operation is defined as follows: Given a position i and a position j the operation moves the number at position i to position j without altering the relative order of the other numbers. If i j, the positions of the numbers between positions j and i - 1 increment by 1, otherwise if i < j the positions of the numbers between positions i+1 and j decreases by 1. This operation requires i steps to find a number to move and j steps to locate the position to which you want to move it. Then the number of steps required to move a number of position i to position j is i+j. We need to design an algorithm that given a list of numbers, determine the optimal (in terms of cost) sequence of moves to rearrange the sequence. Attempts: Part of our investigation was around NP-Completeness, we make it a decision problem and try to find a suitable transformation to any of the problems listed in Garey and Johnson’s book: Computers and Intractability with no results. There is also no direct reference (from our point of view) to this kind of variation in Donald E. Knuth’s book: The art of Computer Programing Vol. 3 Sorting and Searching. We also analyzed algorithms to sort linked lists but none of them gives a good idea to find de optimal sequence of movements. Note that the idea is not to find an algorithm that orders the sequence, but one to tell me the optimal sequence of movements in terms of cost that organizes the sequence, you can make a copy and sort it to analyze the final position of the elements if you want, in fact we may assume that the list contains the numbers from 1 to n, so we know where we want to put each number, we are just concerned with minimizing the total cost of the steps. We tested several greedy approaches but all of them failed, divide and conquer sorting algorithms can’t be used because they swap with no cost portions of the list and our dynamic programing approaches had to consider many cases. The brute force recursive algorithm takes all the possible combinations of movements from i to j and then again all the possible moments of the rest of the element’s, at the end it returns the sequence with less total cost that sorted the list, as you can imagine the cost of this algorithm is brutal and makes it impracticable for more than 8 elements. Our observations: n movements is not necessarily cheaper than n+1 movements (unlike swaps in arrays that are O(1)). There are basically two ways of moving one element from position i to j: one is to move it directly and the other is to move other elements around i in a way that it reaches the position j. At most you make n-1 movements (the untouched element reaches its position alone). If it is the optimal sequence of movements then you didn’t move the same element twice.

  Read the article

• O(log n) algorithm for merging lists and computing rank?

  - by Eternal Learner

  Given two sorted lists, each containing n real numbers, is there a O(log?n) time algorithm to compute the element of rank i (where i coresponds to index in increasing order) in the union of the two lists, assuming the elements of the two lists are distinct? I can think of using a Merge procedure to merge the 2 lists and then find the A[i] element in constant time. But the Merge would take O(n) time. How do we solve it in O(log n) time?

  Read the article

• Sorting and alligning the contents of a text file in Python

  - by Emily Price

  Hello In my program I have a text file that I read from and write to. However, I would like to display the contents of the text file in an alligned and sorted manner. The contents currently read- name, score name, score Would I have to convert this information into lists in order to be able to do this? If so, how do I go about doing this? Thankyou

  Read the article

• nhibernate activerecord lazy collection with custom query

  - by George Polevoy

  What i'm trying to accomplish, is having a temporal soft delete table. table Project(ID int) table ProjectActual(ProjectID int, IsActual bit, ActualAt datetime) Now is it possible to map a collection of actual projects, where project is actual when there is no record in ProjectActual.ProjectID = ID, or the last record sorted by ActualAt descending has IsActual set to 1 (true)?

  Read the article

• iTunes RSS Feed returning max. 100 items instead of 300

  - by TheEye

  I tried the iTunes RSS generator at http://itunes.apple.com/rss/generator/ to download the newest 300 games, which gave me the RSS Feed URL http://itunes.apple.com/us/rss/newapplications/limit=300/genre=6014/xml. However, only 100 are returned, and alphabetically sorted, so the list stops at the letter E ... Did Apple restrict the amount of items one could get without updating their RSS Feed Generator? Or am I missing something?

  Read the article

• How to sort by hexadecimals in xslt?

  - by fielding

  Hi, im trying to sort my transformed output by a element which contains a hex value. <xsl:sort select="Generation/Sirio/Code" data-type="number"/> Values are plain old Hex: 00 01 02 ... 0A ... FF but they are getting sorted like that: 0A FF 00 01 02, which indicates the sorting method fails as soon as there are character involved. How can i work around this? Thank you very much!

  Read the article

• how can i sort one array with 2 child using fork() in c

  - by emrah sari

  example some array {2,8,9,10,21,32,1,6,3...} first child take (data size / 2) and sort second chile take (data size / 2) and sort after combine 2 child data and give us a sorted full data, is it possible with some algorithms?

  Read the article

• How do I sort the outcome of my for-loop in ruby on rails

  - by Angela

  I have a loop as follows: <% for email in @campaign.emails%> <strong>Email: </strong><%=h email.title %> sent after <%=h email.days %> days </br> <% end %> But actually I want it sorted by the email.days value when it displays to the screen. How do I do that?

  Read the article

• Download HTML from website URL in objective C (iphone)

  - by Jonathan

  I'm trying to get the HTML data of a website so that I can parse it. I have parsing bit sorted out but using the following code doesn't seem to work: NSData *data = [[NSData alloc] initWithContentsOfURL: [NSURL URLWithString:@"http://thewebsite.net"]]; Is this the way I should be doing it or is there another way?

  Read the article

• C# calcuate date ranges from a list of dates.

  - by nakulringshia

  Hi Given a list of dates (which may not be sorted), I want to build a list of date ranges - E.g. Assuming MM/DD format, Input - 5/1, 5/5, 5/6, 5/15, 5/7, 5/8, 5/19,5/20, 5/23 Output - Date Range 1: 5/1 to 5/1 Date Range 2: 5/5 to 5/8 Date Range 3: 5/15 to 5/15 Date Range 4: 5/19 to 5/20 Date Range 5: 5/23 to 5/23 Basically, a range should be continuous. Thanks Nakul Ringshia

  Read the article

• Check directory for files, retrieve first file

  - by Lowgain

  I'm writing a small ruby daemon that I am hoping will do the following: Check if a specific directory has files (in this case, .yml files) If so, take the first file (numerically sorted preferrably), and parse into a hash Do a 'yield', with this hash as the argument What I have right now is like: loop do get_next_in_queue { |s| THINGS } end def get_next_in_queue queue_dir = Dir[File.dirname(__FILE__)+'/../queue'] info = YAML::load_file(queue_dir[0]) #not sure if this works or not yield info end I'd like to make the yield conditional if possible, so it only happens if a file is actually found. Thanks!

  Read the article

• ptr to c++ source for a simple mac (cocoa) based console to use as a command interpreter

  - by k2

  I have the command language part sorted out, I'm looking for good sample on how to build a custom console in Cocoa. Need features like copy/paste, command stack, ctrl-z processsing etc. Thanks in advance.

  Read the article

• How do I count the highest key in a python dictionary? (very pythonic way?) EDIT: make a list

  - by alex

  d = {'apple':9,'oranges':3,'grapes':22} How do I return the largest key/value? Edit: How do I make a list that has this sorted by largest to lowest value?

  Read the article

• Displaying a list of items vertically in a table instead of horizonally

  - by MichaelMM

  I have a list of items sorted alphabetically: list = [a,b,c,d,e,f,g,h,i,j] I'm able to output the list in an html table horizonally like so: | a , b , c , d | | e , f , g , h  | | i  , j  ,    ,     | What's the algorithm to create the table vertically like this: | a , d , g , j | | b , e , h ,   | | c , f  ,  i  ,  | I'm using python, but your answer can be in any language or even pseudocode. Thanks

  Read the article

• sort an array such that one half of the array has even numbers in ascending order and the other half

  - by nd81

  Design an algorithm with min time and space here is my solution - assume a array of N elements with 32 bit integers use a bit array to set the appropriate bits the array is sorted now assign even numbers to the first half of the array in ascending order assign odd numbers to the second half of the array in descending order any better solution ?

  Read the article

• Looking for a script/tool to dump a list of installed features and programs on Windows Server 2008 R

  - by Hamish Grubijan

  Hi, The same compiled .Net / C++ / Com program does different things on two seemingly same computers. Both have DOZENS of things installed on them. I would like to figure out what the difference between the two is by looking at an ASCII diff. Before that I need to "serialize" the list of installed things in a plain readable format - sorted alphabetically + one item per line. A Python script would be ideal, but I also have Perl, PowerShell installed. Thank you.

  Read the article

• finding middle element of an array

  - by senthil

  Hi all, I came cross a question in my interview. Question: Array of integers will be given as the input and you should find out the middle element when sorted , but without sorting. For Example. Input: 1,3,5,4,2 Output: 3 When you sort the given input array, it will be 1,2,3,4,5 where middle element is 3. You should find this in one pass without sorting. Any solutions for this?

  Read the article

• how to write Linq2Sql statement to sort several column in cascading way?

  - by Richard77

  Hello, I've 3 columns that I'd like to sort in the Excel way, i.e. sorting the first column, and for each element sorted in the first column, I'll sort the second column, and so on. Let's say I first sort alphabeticaly Countries, then for each country, I sort alphabeticaly cities. How do I do it using Linq2Sql? Thanks for helping

  Read the article

• Sort files by last edited after finding them in a specific directory?

  - by meder

  I'm looking to combine find . -mtime 0 and ls -lt To find all files modified in the last day in the current working directory, sorted by last modification date.

  Read the article

• Algorithm to tell if two arrays have identical members.

  - by nickf

  What's the best algorithm for comparing two arrays to see if they have the same members? Assume there are no duplicates, the members can be in any order, and that neither is sorted. compare( [a, b, c, d], [b, a, d, c] ) ==> true compare( [a, b, e], [a, b, c] ) ==> false compare( [a, b, c], [a, b] ) ==> false

  Read the article

• Trie vs B+ tree

  - by Fakrudeen

  How does Trie and B+ tree compare for indexing lexicographically sorted strings [on the order some billions]? It should support range queries as well. From perf. as well as implementation complexity point of view.

  Read the article

< Previous Page | 18 19 20 21 22 23 24 25 26 27 28 29  | Next Page >