Search Results

Search found 9199 results on 368 pages for 'topological sort'.

facebook twitter digg google delicious technorati stumbleupon myspace wordpress linkedin gmail igoogle windows live tumblr viadeo yahoo buzz yahoo mail yahoo bookmarks favorites email print

Page 6/368 | < Previous Page | 2 3 4 5 6 7 8 9 10 11 12 13  | Next Page >

  • Algorithm to Sort member into groups

    - by kasmanit
    I'll have to develop an application which the final purpose is to sort all the member into groups. Each group will have the same size. And I had to put the members into the groups several times during the execution of the program. To put the member into the groups, a lot of critria are to be look at, because we do not want that two people are put again together two time in the same execution of the program, of course if it's the only way to find a correct solution, it' fine, and there is a lot of other criteria, like some people can be willing to be always with another member. So to resume, we have n members to put in groups of size 8. After the first "round" we have to do again the algorithm to sort them differently. And a lot of critria may go in the calculation of the priority of each member Do you have any idea?

    Read the article

  • Sort an array via x86 Assembly (embedded in C++)?? Possible??

    - by Mark V.
    I am playing around with x86 assembly for the first time and I can't figure out how to sort an array (via insertion sort).. I understand the algorithm, but assembly is confusing me as I primarily use Java & C++. Heres all I have so far int ascending_sort( char arrayOfLetters[], int arraySize ) { char temp; __asm{ push eax push ebx push ecx push edx push esi push edi //// ??? pop edi pop esi pop edx pop ecx pop ebx pop eax } } Basically nothing :( Any ideas?? Thanks in advance.

    Read the article

  • How do i sort by: most viewed, most commented, most popular, best rating, etc?

    - by MrRioku
    Pretty basic question.. I kno.., I just don't know how its done. I see it everywhere. I want to be able to sort out my content in my websites by most viewed, most commented, most popular, best rating, etc...with a drop down list, check box, etc... but I don't know how "sort by" works? Which scripting language should it be written in? Javascript? PHP? Can it be done with XML? Do I have to have a database set up like MySQL? Is there a good tutorial anywhere that explains it? I need to be explained the exact process of how it works. As you can see I really need direction.. Your help is much appreciated :D

    Read the article

  • C++ sort method

    - by qwead
    I want to sort a vector using std::sort, but my sort method is a static method of a class, and I want to call std::sort outside it, but it seems to be trouble doing it this way. On the class: static int CompareIt(void *sol1, void *sol2) { ... } std::sort call: sort(distanceList.at(q).begin(), distanceList.at(q).end(), &DistanceNodeComparator::CompareIt); Shouldn't it be possible to do this way?

    Read the article

  • How to sort a multidimensional array by a certain key?

    - by Eelke
    This should be really simple, but what is the way to go on this. I want to sort an multidimensional array by a key, like this: Array ( [0] => Array ( [iid] => 1 [invitee] => 174 [nid] => 324343 [showtime] => 2010-05-09 15:15:00 [location] => 13 [status] => 1 [created] => 2010-05-09 15:05:00 [updated] => 2010-05-09 16:24:00 ) [1] => Array ( [iid] => 1 [invitee] => 220 [nid] => 21232 [showtime] => 2010-05-09 15:15:00 [location] => 12 [status] => 0 [created] => 2010-05-10 18:11:00 [updated] => 2010-05-10 18:11:00 )) Say i want to sort this by [status], how would I achieve this? Thanks in advance!

    Read the article

  • Is my code a correct implementation of insertion sort?

    - by user1657171
    This code sorts correctly. Is this an insertion sort? import java.util.Scanner; public class InsertionSort { public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.println("Enter the number of elements: "); int count; count = sc.nextInt(); int[] a = new int[count]; System.out.println("Enter elements: "); for(int i = 0 ; i<count;i++){ a[i] = sc.nextInt(); } int j,temp; System.out.println("aftr insertion sort :"); for(int i = 1 ; i<count;i++){ j=i; while(j>0 && a[j-1] > a[j] ){ temp = a[j]; a[j] = a[j-1]; a[j-1] = temp; j--; } } for(int i = 0 ; i<count;i++){ System.out.print(a[i]+" "); } } }

    Read the article

  • Sort algorithms that work on large amount of data

    - by Giorgio
    I am looking for sorting algorithms that can work on a large amount of data, i.e. that can work even when the whole data set cannot be held in main memory at once. The only candidate that I have found up to now is merge sort: you can implement the algorithm in such a way that it scans your data set at each merge without holding all the data in main memory at once. The variation of merge sort I have in mind is described in this article in section Use with tape drives. I think this is a good solution (with complexity O(n x log(n)) but I am curious to know if there are other (possibly faster) sorting algorithms that can work on large data sets that do not fit in main memory. EDIT Here are some more details, as required by the answers: The data needs to be sorted periodically, e.g. once in a month. I do not need to insert a few records and have the data sorted incrementally. My example text file is about 1 GB UTF-8 text, but I wanted to solve the problem in general, even if the file were, say, 20 GB. It is not in a database and, due to other constraints, it cannot be. The data is dumped by others as a text file, I have my own code to read this text file. The format of the data is a text file: new line characters are record separators. One possible improvement I had in mind was to split the file into files that are small enough to be sorted in memory, and finally merge all these files using the algorithm I have described above.

    Read the article

  • Attempt at Merge Sort: Is this correct? [migrated]

    - by Beatrice
    I am trying to write a merge sort algo. I can't tell if this is actually a canonical merge sort. If I knew how to calculate the runtime I would give that a go. Does anyone have any pointers? Thanks. public static void main(String[] argsv) { int[] A = {2, 4, 5, 7, 1, 2, 3, 6}; int[] L, R; L = new int[A.length/2]; R = new int[A.length/2]; int i = 0, j = 0, k; for (k = 0; k < A.length; k++) { if (k < A.length/2) { L[i] = A[k]; i++; } else { R[j] = A[k]; j++; } } i = 0; j = 0; for (k = 0; k < A.length; k++) { System.out.println(i + " " + j + " " + k); if (i < L.length && j < R.length) { if (L[i] < R[j]) { A[k] = L[i]; i++; } else { A[k] = R[j]; j++; } } } }

    Read the article

  • SORT empties my file?

    - by Jonathan Sampson
    I'm attempting to sort a csv on my machine, but I seem to be erasing the contents each time I use the sort command. I've basically created a copy of my csv lacking the first row: sed '1d' original.csv > newcopy.csv To confirm that my new copy exists lacking the first row I can check with head: head 1 newcopy.csv Sure enough, it finds my file and shows me the original second now (now first row). My csv consists of numerous values seperated by commas: Jonathan Sampson,,,,[email protected],,,GA,United States,, Jane Doe,Mrs,,,[email protected],,,FL,United States,32501, As indicated above, some fields are empty. I want to sort based upon the email address field, which is either 4, or 5 - depending on whether the sort command uses a zero-based index. So I'm trying the following: sort -t, +4 -5 newcopy.csv > newcopy.csv So I'm using -t, to indicate that my fields are terminated by the comma, rather than a space. I'm not sure if +4 -5 actually sorts on the email field or not - I could use some help here. And then newcopy.csv > newcopy.csv to overwrite the original file with new sort results. After I do this, if I try to read in the first line: head 1 newcopy.csv I get the following error: head: cannot open `1' for reading: No such file or directory == newcopy.csv <== Sure enough, if I check my directory the file is now empty, and 0 bytes.

    Read the article

  • Bubble sort algorithm implementations (Haskell vs. C)

    - by kingping
    Hello. I have written 2 implementation of bubble sort algorithm in C and Haskell. Haskell implementation: module Main where main = do contents <- readFile "./data" print "Data loaded. Sorting.." let newcontents = bubblesort contents writeFile "./data_new_ghc" newcontents print "Sorting done" bubblesort list = sort list [] False rev = reverse -- separated. To see rev2 = reverse -- who calls the routine sort (x1:x2:xs) acc _ | x1 > x2 = sort (x1:xs) (x2:acc) True sort (x1:xs) acc flag = sort xs (x1:acc) flag sort [] acc True = sort (rev acc) [] False sort _ acc _ = rev2 acc I've compared these two implementations having run both on file with size of 20 KiB. C implementation took about a second, Haskell — about 1 min 10 sec. I have also profiled the Haskell application: Compile for profiling: C:\Temp ghc -prof -auto-all -O --make Main Profile: C:\Temp Main.exe +RTS -p and got these results. This is a pseudocode of the algorithm: procedure bubbleSort( A : list of sortable items ) defined as: do swapped := false for each i in 0 to length(A) - 2 inclusive do: if A[i] > A[i+1] then swap( A[i], A[i+1] ) swapped := true end if end for while swapped end procedure I wonder if it's possible to make Haskell implementation work faster without changing the algorithm (there's are actually a few tricks to make it work faster, but neither implementations have these optimizations)

    Read the article

  • Une interface holographique pour le futur Android, Google sort la première vidéo de présentation de « Honeycomb »

    Une interface holographique pour le futur Android Google sort une vidéo de présentation de « Honeycomb » Dans une vidéo publiée sur son blog mobile, Google a levé le voile sur la future version d'Android (3.0 ou 2.4) alias « Honeycomb ». Cette prochaine version sera dotée de plusieurs nouvelles fonctionnalités. Google affirme avoir mit l'accent sur l'amélioration de l'expérience utilisateur, notamment en dotant Honeycomb d'une UI virtuelle et holographique. Plusieurs fonctionnalités existantes ont été revues, parmi lesquelles le traitement multi-tâches, le système de notification - qualifié « de plus élégant », l'écran d'accueil (avec désormais des effets 3D et des Widgets...

    Read the article

  • Apple sort la deuxième bêta d'iOS 5, déjà débridée, cette version active la synchronisation Wi-Fi

    Apple sort la deuxième bêta d'iOS 5 Déjà débridée, cette version active la synchronisation Wi-Fi Mise à jour du 27/06/2011 par Idelways La deuxième bêta d'iOS 5, le système d'exploitation mobile d'Apple est disponible pour les développeurs et les nombreux utilisateurs impatients qui l'ont installé... même sans compte Développeur. À côté du bon paquet de bogues corrigés depuis la première bêta lancée durant le WWDC 2011 (lire ci-devant), cette nouvelle version permet de tester enfin la synchronisation Wi-Fi qui coupe pour la première fois le cordon ombilical reliant les iPhone, iPad et iPod touch aux ordinateurs.

    Read the article

  • Eclipse sort la version 1.0 d'Orion, son environnement de développement Web dans le Cloud

    Eclipse sort la version 1.0 d'Orion son environnement de développement Web dans le Cloud L'événement EclipseCon Europe a été l'occasion pour les développeurs d'Orion de dévoiler la première version da la plateforme de développement dans le Cloud de la fondation. Orion avait été présenté au stade de prototype en mars 2011 et mettait à la disposition des développeurs des outils d'intégration et de développement Web pouvant être utilisés dans un navigateur, sans nécessiter l'installation d'outils supplémentaires. Après plusieurs mois de tests, de correction des bugs et d'ajout des nouveautés en fonction des retours des utilisateurs, Orion est prêt pour une utilisation en envi...

    Read the article

  • Microsoft Forefront Endpoint Protection 2010 sort en version RTM avec un nouveau moteur anti-malwares

    Microsoft Forefront Endpoint Protection 2010 sort en version RTM Pour les constructeurs et les revendeurs, elle embarque un nouveau moteur anti-malwares Microsoft vient d'annoncer la disponibilité pour les constructeurs et revendeurs (version RTM) de Forefront Endpoint Security 2010, sa solution d'administration unifiée pour la protection contre les malwares pour les serveurs et les postes de travail des entreprises. En Release Candidate depuis novembre, cette version s'appuie sur « System Center Configuration Manager 2007 », facilitant ainsi le déploiement au niveau des entreprises ayant déjà mis en place des infrastructures de gestion des postes clients de Microsoft. Fore...

    Read the article

  • Adobe sort Flex 4 et Flash Builder 4 et deux outils complémentaires pour optimiser le développement

    Mise à jour du 29/03/10 Adobe sort deux outils complémentaires de Flex 4 et Flash Builder 4 Pour optimiser le développement d'applications web RIA Comme dit précédemment (lire ci-avant), Adobe vient de sortir Flash Builder 4. Mais une autre nouveauté vient également d'arriver: ColdFusion Builder. ColdFusion Builder est un nouvel environnement de développement intégré basé sur Eclipse (IDE) qui permet de créer - « rapidement et efficacement » selon les termes d'Adobe - des applications ColdFusion. ColdFusion Builder offre donc un environnement de développement évolutif, personnalisable et unifié pour la programma...

    Read the article

  • Google sort un outil qui permet le support de WebM dans IE9, en collaboration avec Microsoft

    Google sort un outil qui permet le support de WebM dans IE9 En collaboration avec Microsoft Quelques jours après la sortie du navigateur de Microsoft Internet Explorer 9 en version finale, Google propose une version préliminaire d'un outil permettant le support du format vidéo open source WebM. L'application, baptisée WebM Media Foundation (MF) Components for Microsoft Internet Explorer 9, utilise l'API Microsoft Media Foundation pour permettre une intégration transparente avec Windows de WebM. A signaler, la réalisation de cet outil a été faite en étroite collaboration avec Microsoft. Etant donné que l'applicatio...

    Read the article

  • How to sort a ListView control by a column in Visual C#

    - by bconlon
    Microsoft provide an article of the same name (previously published as Q319401) and it shows a nice class 'ListViewColumnSorter ' for sorting a standard ListView when the user clicks the column header. This is very useful for String values, however for Numeric or DateTime data it gives odd results. E.g. 100 would come before 99 in an ascending sort as the string compare sees 1 < 9. So my challenge was to allow other types to be sorted. This turned out to be fairly simple as I just needed to create an inner class in ListViewColumnSorter which extends the .Net CaseInsensitiveComparer class, and then use this as the ObjectCompare member's type. Note: Ideally we would be able to use IComparer as the member's type, but the Compare method is not virtual in CaseInsensitiveComparer , so we have to create an exact type: public class ListViewColumnSorter : IComparer {     private CaseInsensitiveComparer ObjectCompare;     private MyComparer ObjectCompare;     ... rest of Microsofts class implementation... } Here is my private inner comparer class, note the 'new int Compare' as Compare is not virtual, and also note we pass the values to the base compare as the correct type (e.g. Decimal, DateTime) so they compare correctly: private class MyComparer : CaseInsensitiveComparer {     public new int Compare(object x, object y)     {         try         {             string s1 = x.ToString();             string s2 = y.ToString();               // check for a numeric column             decimal n1, n2 = 0;             if (Decimal.TryParse(s1, out n1) && Decimal.TryParse(s2, out n2))                 return base.Compare(n1, n2);             else             {                 // check for a date column                 DateTime d1, d2;                 if (DateTime.TryParse(s1, out d1) && DateTime.TryParse(s2, out d2))                     return base.Compare(d1, d2);             }         }         catch (ArgumentException) { }           // just use base string compare         return base.Compare(x, y);     } } You could extend this for other types, even custom classes as long as they support ICompare. Microsoft also have another article How to: Sort a GridView Column When a Header Is Clicked that shows this for WPF, which looks conceptually very similar. I need to test it out to see if it handles non-string types. #

    Read the article

  • Virtualisation : Microsoft sort la RC d'Hyper-V Server 2012 qui supporte jusqu'à 4 téraoctets de RAM

    Virtualisation : Microsoft sort la RC d'Hyper-V Server 2012 Disponible en téléchargement gratuit La conférence TechEd North-America a été cette semaine l'occasion pour Microsoft de présenter Hyper-V Server 2012 et d'annoncer la disponibilité de sa Release Candidate en téléchargement gratuit. C'était aussi l'occasion pour Jeff Woolsey, Microsoft Principal Program Manager, d'offrir plus de détails sur les nouveautés de ce moteur de virtualisation (hyperviseur), en dehors de ce que l'on savait sur son intégration avec Windows Server 2012 (ex. Windows Server 8)...

    Read the article

  • Alternatives for 'egrep -o "success|error|fail" <filename> | sort | uniq -c'

    - by Wolfy
    I sometime need to check some logs and I do this with this command: egrep -o "success|error|fail" <filename> | sort | uniq -c Sample input: test error on line 10 test connect success test insert success test started at 00:00 test delete fail Sample output: 1 error 1 fail 2 success I would like to know if someone knows a way to do this with a shorter command? Before you ask why I would like to do this with an different command... No special reason, I'm just curious :)

    Read the article

  • Microsoft sort Windows Server AppFabric en RC et BizTalk en beta pour simplifier le développement d'

    Mise à jour du 25/05/10 Microsoft sort Windows Server AppFabric en RC et BizTalk en beta Pour simplifier le développement d'applications webs et composites Microsoft vient de sortir la Release Candidate de Windows Server AppFabric (le code finalisé est lui attendu pour Juin). Microsoft a également annoncé la disponibilité de la première béta de BizTalk Server 2010, la "solution serveur d'intégration d'entreprise et de connectivité" qui vise à "intégrer efficacement des systèmes hétérogènes, améliorer la connectivité de l'entreprise et échanger plus rapidement des données au travers des plateformes multiples&qu...

    Read the article

  • How to change FAT32 sort order on drive?

    - by Chad--24216
    I use a USB drive to play music in my car. Unfortunately, the car does not sort the music alphabetically and relies on how the music is sorted on the FAT32 drive. This Windows software here solves the problem. Anything comparable available for me on Ubuntu? PS: at first I thought it was a file creation date problem askubuntu question. But although I figured out the answer to that question, it didn't solve the problem like I thought it would.

    Read the article

  • Oracle sort VirtualBox 3.2, des performances accrues et plus d'OS supportés pour la nouvelle version

    Mise à jour du 25/05/10 Oracle sort VirtualBox 3.2 Des performances accrues et plus d'OS supportés pour la nouvelle version de l'ex-outil de virtualisation de Sun VirtualBox 3.2.0 est la première version de l'outil de virtualisation de Sun à porter le logo d'Oracle. Le géant du logiciel en profite au passage pour rebaptiser le produit « Oracle VM VirtualBox ». [IMG]http://ftp-developpez.com/gordon-fowler/VBox%20Nouveau%20Logo.png[/IMG] Les améliorations concernent principalement les performances et les nouveaux systèmes d'exploitations pris en charge. VirtualBox 3.2.0 peut à présent...

    Read the article

facebook twitter digg google delicious technorati stumbleupon myspace wordpress linkedin gmail igoogle windows live tumblr viadeo yahoo buzz yahoo mail yahoo bookmarks favorites email print

< Previous Page | 2 3 4 5 6 7 8 9 10 11 12 13  | Next Page >