Skip to content

List, Data Structure

Published by Matheus (X-warrior) Bratfisch on April 25, 2009

Good afternoon,

Like I said before I’m having Data Structure class. And today I will introduce you the List concept. A linear data structure. There is similar data structures like linked list, double linked list. The stack and the queue are special implementations of lists. The list can receive elements in any position, remove elements from any position, remove a specified element, add in order and others.

The professor told us to solve this:

1. Create the data type tLista in a headerfile
2. This list must be a list of elements of tAgenda
3. The type tAgenda is a type that represents a name (30 chars) and a telephone number
4. Create a function maior(a,b) that compare the name of 2 entries
5. Implement all the functions
6. Create a program that have a menu to use all functions and the specified search must use the name.
7. The program should be able to show the list in alphabetic order

List implementation.

Regards,
Matheus

Published inCEstrutura de Dados

4,722 Comments

  7. doce doce

    It’s very easy to find out any matter on net as compared to textbooks, as I found this paragraph at this web site.

    # April 9, 2026
  11. otsobet otsobet

    This article will assist the internet people for building up new webpage or even a weblog from start to end.

    # April 9, 2026

Leave a Reply

Your email address will not be published. Required fields are marked *