/ Published in: C++
Biblioteka za rjeÅ¡enje pomoÄu polja.
Expand |
Embed | Plain Text
Copy this code and paste it in your HTML
#include <cstdlib> #include <iostream> using namespace std; struct tpopis { int rb; int x; int y; int p; }; struct r{ tpopis popis[10000]; int front, rear; }; int addone(int i){ return ((i+1)%10000); }; void initq(r *red){ red->front=0; red->rear=9999; //zadnji el polja cout<<"Inicijaliziranje reda!!"<<endl; }; bool isemptyq(r *red){ if(addone(red->rear)==red->front) return true; else return false; }; void enqueueq(tpopis x, r *red){ if(addone(addone(red->rear))==(red->front)) cout<<"Red je trenutno pun!"; else { red->rear=addone(red->rear); red->popis[red->rear]=x; } }; void dequeueq(r *red){ if(isemptyq(red)) cout<<"Red je trenutno prazan!"; else red->front=addone(red->front); }; tpopis frontq(r *red){ if(isemptyq(red)) cout<<"Red je trenutno prazan!"; else return (red->popis[red->front]); };
URL: www.snipplr.com/strukture_biblioteka_polje