Results 1 to 2 of 2

Hybrid View

Previous Post Previous Post   Next Post Next Post
  1. #1
    Registered User
    Join Date: Apr:2009
    Location: Áëàãîåâãðàä
    Posts: 1

    Âúïðîñ çà STL â Ñ++

    Àêî ñîðòèðàì ìàñèâ îò ÷èñëà, ïîëçâàéêè sort îò algorithm ïèøåì
    int a[50];
    âúâåæäàì ìàñèâ îò n ÷èñëà
    sort(a,a+n);
    è âñè÷êî å ÎÊ
    êàêâî ïèøåì àêî èñêàì äà ïîëçâàì sort() äà ñîðòèðàì ìàñèâ îò òèï ñòðóêòóðà ïî íÿêîå îò ïîëåòàòà ïðèìåðíî èìàì
    struct student
    {char name[30];
    int number;
    double usp;};
    student s[50];
    êàê ÷ðåç sort äà ñîðòèðàì ìàñèâà s?

  2. #2
    Registered User
    Join Date: Oct:2003
    Location: Ñîôèÿ
    Posts: 4,317

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •  

Copyright © 1999-2011 Õàðäóåð ÁÃ. Âúçìîæíî å ñúäúðæàíèåòî íà òàçè ñòðàíèöà äà å îáåêò íà àâòîðñêè ïðàâà.
iskamPC.com | mobility.BG | Bloody's Techblog | Êðèïòîâàëóòè è ìàéíèíã | 3D Vision Blog | Ìàãàçèí çà åëåêòðîííè öèãàðè