/printf

_printf

Primary LanguageC

0x1B. C - Sorting algorithms & Big O

Stacks, Queues - LIFO, FIFO 🥞

Imagine that you are cooks a pancakes 🥞 and you put one over one so if you need to take one necesry you take the last one so that data structure is named like a stack. Similarly exist the queues imagine that you are wait on the bank row 🏃🏃🏃🏃 for your turn so is logical the first person came wilbe the first person in to out the row and for that reason be attended.

This project was created to Holberton School.

Contents 📋

Description 📐

0. push, pall mandatory

Implement the push and pall opcodes.

Contents 📋

#include<stdio.h> 
#include<signal.h> 
  
int main() 
{ 
    handle_sigint;
    signal(SIGINT, handle_sigint); 
    while (1) 
    { 
        printf("hello world\n"); 
        sleep(1); 
    } 
    return 0; 
} 

Description 📐

The file explorer is accessible using the button in left corner of the navigation bar. You can create a new file by clicking the New file button in the file explorer. You can also create folders by clicking the New folder button.

Usage 🔨

All your files and folders are presented as a tree in the file explorer. You can switch from one to another by clicking a file in the tree.

Example 💻

You can rename the current file by clicking the file name in the navigation bar or by clicking the Rename button in the file explorer.

Installation 💾

You can delete the current file by clicking the Remove button in the file explorer. The file will be moved into the Trash folder and automatically deleted after 7 days of inactivity.

File Structure 📁

You can export the current file by clicking Export to disk in the menu. You can choose to export the file as plain Markdown, as HTML using a Handlebars template or as a PDF.