Skip to content

Instantly share code, notes, and snippets.

🎯
Focusing

Adem Budak p1v0t

Block or report user

Report or block p1v0t

Hide content and notifications from this user.

Learn more about blocking users

Contact Support about this user’s behavior.

Learn more about reporting abuse

Report abuse
View GitHub Profile
View GenericBubbleSort.c
#include <stddef.h>
#include <stdint.h>
#include <stdio.h>
typedef uint8_t byte;
static int compInt(const void *x, const void *y) {
const int first = *(const int *)x;
const int second = *(const int *)y;
View lambda.cpp
#include <iostream>
#include <string>
using namespace std;
int main()
{
{
auto lambdaFunc = [] { cout << "Hello World\n"; };
View CellPhone.cpp
CellPhone nokia; // sırasıyla, default ctor'ı, ardından dtor'ı çağırır
CellPhone tmp(nokia); // copy ctor'ı çağırır
tmp = nokia; // operator= çağırır.
View CellPhone.cpp
class CellPhone
{
public:
CellPhone() = default;
CellPhone(const CellPhone& ) = default;
auto& operator= (const CellPhone& ) { return *this; }
~CellPhone() = default;
};
View argv.c
#include <stdio.h>
int main(int argc, char **argv){
int i;
for(i = 0; i < argc; i++)
printf("%s ", argv[i] );
return 0;
}
View hello.c
#include <stdio.h>
int main(int argc, char **argv){
if (argv[1])
printf("Hello %s\n", argv[1]);
else
printf("hello user\n");
return 0;
View sequential_containers.cpp
#include <array>
#include <vector>
#include <deque>
#include <forward_list>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#include <iterator>
View table.md
Veri Yapısı Erişim Arama Ekleme Silme
Array O(1) O(n) O(n) O(n)
Vector O(1) O(n) O(1) O(1)
Deque O(1) O(n) O(1) O(1)
Forward List O(n) O(n) O(1) O(1)
List O(n) O(n) O(1) O(1)
Stack O(n) O(n) O(1) O(1)
Queue O(n) O(n) O(1) O(1)
View list.cpp
#include <list>
#include <iostream>
int main() {
const int elements = 10;
std::list<int> li;
for (size_t i = 0; i < elements; i++)
You can’t perform that action at this time.