Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //Разработать функцию, определяющую значение и номер первого минимального элемента списка
- #include "stdafx.h"
- #include <stdlib.h>
- typedef struct number {
- int value;
- struct number *next;
- } number;
- number * push(number *head) {
- int i, n, val;
- number *tmp;
- printf("Enter the number of items:");
- scanf("%d", &n);
- scanf("%d", &val);
- head = (number*)malloc(sizeof(number));
- head->value = val;
- head->next = NULL;
- for (i = 1; i < n; i++) {
- tmp = (number*)malloc(sizeof(number));
- scanf("%d", &val);
- tmp->value = val;
- tmp->next = head;
- head = tmp;
- }
- return head;
- }
- void finding(number *head) {
- number *tmp;
- int min = head->value, s = 1, s1 = 0;
- tmp = head;
- for (; tmp;) {
- if (min > tmp->value) {
- min = tmp->value;
- s1 = s;
- }
- tmp = tmp->next;
- s++;
- }
- printf("Index: %d. Min: %d", s-s1-1, min);
- }
- int main() {
- number *head = NULL;
- head = push(head);
- finding(head);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement