Products
Mind Mapping Software
Outlining Software
Gantt Charts Software
Uses
Mind Maps for Education
Mind Maps for Business
Mind Maps for Personal Development
Mind Mapping Benefits
Resources
Features
Education
Personal & Work
Desktop
Video Tutorials
Watch tips and tricks about using Mindomo.
Help Center
Detailed help guide on configuring and using Mindomo.
Articles
Top 29 Mind Map Examples
Gantt Chart Software
Concept Map Template
Free mind map software
What is a concept map?
Gantt Chart Maker
Mind Map App
Concept Map Maker
Mind map template
Pricing
Log in
Sign Up
Products
Mind Mapping Software
Outlining Software
Gantt Charts Software
Uses
Mind Maps for Education
Mind Maps for Business
Mind Maps for Personal Development
Mind Mapping Benefits
Resources
Blog
Video Tutorials
Help Center
What is Mind Mapping?
Create a Mind Map Online
Concept Map Maker
Articles
Top 29 Mind Map Examples
Gantt Chart Software
Concept Map Template
Free mind map software
What is a concept map?
Gantt Chart Maker
Mind Map App
Concept Map Maker
Mind map template
Features
Education
Personal & Work
Desktop
Pricing
Sign Up
Log in
Categories:
All
-
seznam
-
implementace
-
funkce
by
Dominik Lackovic
11 years ago
308
Zadatak 1
Text se zabývá implementací seznamu v jazyce C++ s využitím ukazatelů a polí. Popisuje strukturu seznamu pomocí ukazatelů, kde každý prvek obsahuje hodnotu a ukazatel na další prvek.
Open
More like this
Z2_MM_mkamence
by Monika Kamenčev
Z2_MM_mkamence
by Monika Kamenčev
Z2_MM_atomas
by Anto Tomaš
Strukture podataka zadatak 1
by Tino Balint
Lista u C++
Implementacija
Pokazivači
struct lis{ elementtype value; lis *next; }; typedeflis *element; typedef lis list;
Polje
typedef int element; struct Lis { elementtype values[10000]; int cursor; }; typedef struct Lis list;
Datoteke zaglavlja
lista_pokazivac.h
lista_polje.h
Zadatak
Brisanje unosa
Pretraživanje liste te ispis rezultata
Sortiranje algoritmom Quicksort
Unos podataka o zaposlenicima
Funkcije
InitL(L) - stvara se nova lista
DeleteAllL(L) - brišu se svi elementi liste
RetrieveL(i,L) - vraća se vrijednost elementa na poziciji i
DeleteL(i,L) - briše se element liste na poziciji i
InsertL(i,j,L) - listi se dodaje element s vrijednosti i na poziciju j
LocateL(i,L) - traži se vrijednost i
PreviousL(i,L) - vraća vrijednost elementa prije i
NextL(i,L) - vraća vrijednost elementa nakon i
EndL(L) - vraća lokaciju nakon zadnjeg elementa liste
FirstL(L) - vraća lokaciju prvog elementa